/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe008_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 22:28:20,198 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 22:28:20,201 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 22:28:20,216 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 22:28:20,216 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 22:28:20,217 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 22:28:20,219 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 22:28:20,220 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 22:28:20,222 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 22:28:20,223 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 22:28:20,224 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 22:28:20,225 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 22:28:20,225 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 22:28:20,226 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 22:28:20,227 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 22:28:20,228 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 22:28:20,229 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 22:28:20,230 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 22:28:20,232 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 22:28:20,234 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 22:28:20,235 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 22:28:20,237 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 22:28:20,238 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 22:28:20,239 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 22:28:20,241 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 22:28:20,242 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 22:28:20,242 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 22:28:20,243 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 22:28:20,246 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 22:28:20,248 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 22:28:20,248 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 22:28:20,249 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 22:28:20,251 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 22:28:20,252 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 22:28:20,253 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 22:28:20,253 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 22:28:20,254 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 22:28:20,254 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 22:28:20,254 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 22:28:20,259 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 22:28:20,259 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 22:28:20,263 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 22:28:20,287 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 22:28:20,287 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 22:28:20,288 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 22:28:20,289 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 22:28:20,289 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 22:28:20,289 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 22:28:20,289 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 22:28:20,289 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 22:28:20,290 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 22:28:20,290 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 22:28:20,290 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 22:28:20,290 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 22:28:20,290 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 22:28:20,291 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 22:28:20,291 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 22:28:20,291 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 22:28:20,291 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 22:28:20,292 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 22:28:20,292 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 22:28:20,292 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 22:28:20,292 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 22:28:20,292 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 22:28:20,293 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 22:28:20,293 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 22:28:20,293 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 22:28:20,293 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 22:28:20,293 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 22:28:20,294 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 22:28:20,294 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 22:28:20,294 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 22:28:20,589 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 22:28:20,601 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 22:28:20,605 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 22:28:20,606 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 22:28:20,606 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 22:28:20,607 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe008_rmo.oepc.i [2019-12-18 22:28:20,677 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14102684b/20ce7fd3ea20494582bbec7e2dda9e41/FLAG2b7871f12 [2019-12-18 22:28:21,300 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 22:28:21,300 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe008_rmo.oepc.i [2019-12-18 22:28:21,314 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14102684b/20ce7fd3ea20494582bbec7e2dda9e41/FLAG2b7871f12 [2019-12-18 22:28:21,522 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14102684b/20ce7fd3ea20494582bbec7e2dda9e41 [2019-12-18 22:28:21,531 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 22:28:21,533 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 22:28:21,534 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 22:28:21,534 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 22:28:21,538 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 22:28:21,539 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:28:21" (1/1) ... [2019-12-18 22:28:21,541 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fc0254b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:28:21, skipping insertion in model container [2019-12-18 22:28:21,542 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:28:21" (1/1) ... [2019-12-18 22:28:21,549 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 22:28:21,606 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 22:28:22,148 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 22:28:22,167 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 22:28:22,255 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 22:28:22,326 INFO L208 MainTranslator]: Completed translation [2019-12-18 22:28:22,326 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:28:22 WrapperNode [2019-12-18 22:28:22,327 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 22:28:22,327 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 22:28:22,328 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 22:28:22,328 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 22:28:22,336 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:28:22" (1/1) ... [2019-12-18 22:28:22,361 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:28:22" (1/1) ... [2019-12-18 22:28:22,395 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 22:28:22,395 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 22:28:22,395 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 22:28:22,396 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 22:28:22,404 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:28:22" (1/1) ... [2019-12-18 22:28:22,404 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:28:22" (1/1) ... [2019-12-18 22:28:22,409 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:28:22" (1/1) ... [2019-12-18 22:28:22,410 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:28:22" (1/1) ... [2019-12-18 22:28:22,421 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:28:22" (1/1) ... [2019-12-18 22:28:22,425 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:28:22" (1/1) ... [2019-12-18 22:28:22,429 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:28:22" (1/1) ... [2019-12-18 22:28:22,434 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 22:28:22,435 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 22:28:22,435 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 22:28:22,435 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 22:28:22,436 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:28:22" (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 22:28:22,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 22:28:22,507 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 22:28:22,508 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 22:28:22,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 22:28:22,508 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 22:28:22,508 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 22:28:22,508 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 22:28:22,508 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 22:28:22,509 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 22:28:22,509 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 22:28:22,509 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 22:28:22,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 22:28:22,509 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 22:28:22,511 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 22:28:23,252 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 22:28:23,252 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 22:28:23,254 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:28:23 BoogieIcfgContainer [2019-12-18 22:28:23,254 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 22:28:23,255 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 22:28:23,255 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 22:28:23,259 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 22:28:23,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 10:28:21" (1/3) ... [2019-12-18 22:28:23,260 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4723258a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:28:23, skipping insertion in model container [2019-12-18 22:28:23,260 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:28:22" (2/3) ... [2019-12-18 22:28:23,261 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4723258a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:28:23, skipping insertion in model container [2019-12-18 22:28:23,261 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:28:23" (3/3) ... [2019-12-18 22:28:23,263 INFO L109 eAbstractionObserver]: Analyzing ICFG safe008_rmo.oepc.i [2019-12-18 22:28:23,273 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 22:28:23,273 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 22:28:23,282 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 22:28:23,283 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 22:28:23,325 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,325 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,326 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,326 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,326 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,326 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,327 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,327 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,328 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,328 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,329 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,329 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,329 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,329 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,330 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,330 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,330 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,331 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,331 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,331 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,331 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,332 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,332 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,332 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,333 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,333 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,333 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,333 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,334 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,334 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,334 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,335 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,335 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,335 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,336 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,336 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,336 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,336 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,337 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,337 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,337 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,338 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,338 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,338 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,339 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,339 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,339 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,339 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,363 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,363 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,363 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,364 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,364 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,366 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,366 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,366 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,367 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,368 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,368 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,368 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,368 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,369 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,369 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,369 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,370 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,370 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,370 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,370 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,371 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,372 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,372 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,372 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,372 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,373 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,373 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,373 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,373 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,373 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,377 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,378 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,378 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,378 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,378 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,378 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,378 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,379 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,379 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,379 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,383 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,384 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,388 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,389 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:23,405 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 22:28:23,426 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 22:28:23,426 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 22:28:23,426 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 22:28:23,426 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 22:28:23,427 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 22:28:23,427 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 22:28:23,427 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 22:28:23,427 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 22:28:23,451 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 212 transitions [2019-12-18 22:28:23,453 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-18 22:28:23,544 INFO L126 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-18 22:28:23,545 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 22:28:23,563 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 342 event pairs. 9/169 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 22:28:23,590 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-18 22:28:23,646 INFO L126 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-18 22:28:23,646 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 22:28:23,654 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 342 event pairs. 9/169 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 22:28:23,674 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17114 [2019-12-18 22:28:23,675 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 22:28:27,000 WARN L192 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-18 22:28:27,130 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-18 22:28:27,161 INFO L206 etLargeBlockEncoding]: Checked pairs total: 84694 [2019-12-18 22:28:27,161 INFO L214 etLargeBlockEncoding]: Total number of compositions: 109 [2019-12-18 22:28:27,165 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 98 places, 111 transitions [2019-12-18 22:28:49,354 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 129812 states. [2019-12-18 22:28:49,356 INFO L276 IsEmpty]: Start isEmpty. Operand 129812 states. [2019-12-18 22:28:49,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 22:28:49,362 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:28:49,363 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 22:28:49,363 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 22:28:49,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:28:49,369 INFO L82 PathProgramCache]: Analyzing trace with hash 841641, now seen corresponding path program 1 times [2019-12-18 22:28:49,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:28:49,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456035933] [2019-12-18 22:28:49,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:28:49,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:28:49,577 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 22:28:49,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456035933] [2019-12-18 22:28:49,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:28:49,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 22:28:49,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840751298] [2019-12-18 22:28:49,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:28:49,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:28:49,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:28:49,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:28:49,600 INFO L87 Difference]: Start difference. First operand 129812 states. Second operand 3 states. [2019-12-18 22:28:52,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:28:52,733 INFO L93 Difference]: Finished difference Result 129324 states and 557563 transitions. [2019-12-18 22:28:52,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:28:52,736 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 22:28:52,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:28:53,658 INFO L225 Difference]: With dead ends: 129324 [2019-12-18 22:28:53,665 INFO L226 Difference]: Without dead ends: 126776 [2019-12-18 22:28:53,667 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 22:29:00,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126776 states. [2019-12-18 22:29:03,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126776 to 126776. [2019-12-18 22:29:03,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126776 states. [2019-12-18 22:29:03,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126776 states to 126776 states and 547175 transitions. [2019-12-18 22:29:03,907 INFO L78 Accepts]: Start accepts. Automaton has 126776 states and 547175 transitions. Word has length 3 [2019-12-18 22:29:03,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:29:03,907 INFO L462 AbstractCegarLoop]: Abstraction has 126776 states and 547175 transitions. [2019-12-18 22:29:03,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:29:03,908 INFO L276 IsEmpty]: Start isEmpty. Operand 126776 states and 547175 transitions. [2019-12-18 22:29:03,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 22:29:03,913 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:29:03,913 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:29:03,913 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 22:29:03,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:29:03,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1225155789, now seen corresponding path program 1 times [2019-12-18 22:29:03,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:29:03,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899511950] [2019-12-18 22:29:03,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:29:03,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:29:04,102 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 22:29:04,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899511950] [2019-12-18 22:29:04,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:29:04,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:29:04,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211977238] [2019-12-18 22:29:04,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:29:04,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:29:04,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:29:04,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:29:04,106 INFO L87 Difference]: Start difference. First operand 126776 states and 547175 transitions. Second operand 4 states. [2019-12-18 22:29:10,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:29:10,079 INFO L93 Difference]: Finished difference Result 198216 states and 822018 transitions. [2019-12-18 22:29:10,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:29:10,080 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 22:29:10,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:29:10,747 INFO L225 Difference]: With dead ends: 198216 [2019-12-18 22:29:10,748 INFO L226 Difference]: Without dead ends: 198167 [2019-12-18 22:29:10,748 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 22:29:16,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198167 states. [2019-12-18 22:29:26,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198167 to 182118. [2019-12-18 22:29:26,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182118 states. [2019-12-18 22:29:27,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182118 states to 182118 states and 765134 transitions. [2019-12-18 22:29:27,032 INFO L78 Accepts]: Start accepts. Automaton has 182118 states and 765134 transitions. Word has length 11 [2019-12-18 22:29:27,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:29:27,033 INFO L462 AbstractCegarLoop]: Abstraction has 182118 states and 765134 transitions. [2019-12-18 22:29:27,033 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:29:27,033 INFO L276 IsEmpty]: Start isEmpty. Operand 182118 states and 765134 transitions. [2019-12-18 22:29:27,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 22:29:27,039 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:29:27,040 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:29:27,040 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 22:29:27,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:29:27,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1435968535, now seen corresponding path program 1 times [2019-12-18 22:29:27,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:29:27,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706701970] [2019-12-18 22:29:27,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:29:27,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:29:27,185 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 22:29:27,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706701970] [2019-12-18 22:29:27,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:29:27,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:29:27,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650281501] [2019-12-18 22:29:27,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:29:27,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:29:27,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:29:27,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:29:27,189 INFO L87 Difference]: Start difference. First operand 182118 states and 765134 transitions. Second operand 4 states. [2019-12-18 22:29:34,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:29:34,412 INFO L93 Difference]: Finished difference Result 260296 states and 1067327 transitions. [2019-12-18 22:29:34,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:29:34,412 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 22:29:34,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:29:36,182 INFO L225 Difference]: With dead ends: 260296 [2019-12-18 22:29:36,182 INFO L226 Difference]: Without dead ends: 260233 [2019-12-18 22:29:36,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 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 22:29:47,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260233 states. [2019-12-18 22:29:50,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260233 to 221154. [2019-12-18 22:29:50,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221154 states. [2019-12-18 22:29:52,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221154 states to 221154 states and 922215 transitions. [2019-12-18 22:29:52,810 INFO L78 Accepts]: Start accepts. Automaton has 221154 states and 922215 transitions. Word has length 13 [2019-12-18 22:29:52,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:29:52,810 INFO L462 AbstractCegarLoop]: Abstraction has 221154 states and 922215 transitions. [2019-12-18 22:29:52,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:29:52,810 INFO L276 IsEmpty]: Start isEmpty. Operand 221154 states and 922215 transitions. [2019-12-18 22:29:52,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 22:29:52,814 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:29:52,814 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:29:52,814 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 22:29:52,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:29:52,814 INFO L82 PathProgramCache]: Analyzing trace with hash 472638345, now seen corresponding path program 1 times [2019-12-18 22:29:52,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:29:52,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758172396] [2019-12-18 22:29:52,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:29:52,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:29:52,881 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 22:29:52,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758172396] [2019-12-18 22:29:52,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:29:52,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:29:52,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086645724] [2019-12-18 22:29:52,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:29:52,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:29:52,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:29:52,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:29:52,883 INFO L87 Difference]: Start difference. First operand 221154 states and 922215 transitions. Second operand 3 states. [2019-12-18 22:29:53,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:29:53,049 INFO L93 Difference]: Finished difference Result 42754 states and 139696 transitions. [2019-12-18 22:29:53,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:29:53,050 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 22:29:53,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:29:53,123 INFO L225 Difference]: With dead ends: 42754 [2019-12-18 22:29:53,124 INFO L226 Difference]: Without dead ends: 42754 [2019-12-18 22:29:53,124 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 22:29:53,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42754 states. [2019-12-18 22:29:55,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42754 to 42754. [2019-12-18 22:29:55,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42754 states. [2019-12-18 22:29:55,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42754 states to 42754 states and 139696 transitions. [2019-12-18 22:29:55,728 INFO L78 Accepts]: Start accepts. Automaton has 42754 states and 139696 transitions. Word has length 13 [2019-12-18 22:29:55,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:29:55,728 INFO L462 AbstractCegarLoop]: Abstraction has 42754 states and 139696 transitions. [2019-12-18 22:29:55,728 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:29:55,728 INFO L276 IsEmpty]: Start isEmpty. Operand 42754 states and 139696 transitions. [2019-12-18 22:29:55,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 22:29:55,733 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:29:55,733 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:29:55,734 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 22:29:55,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:29:55,734 INFO L82 PathProgramCache]: Analyzing trace with hash -589628414, now seen corresponding path program 1 times [2019-12-18 22:29:55,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:29:55,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710258479] [2019-12-18 22:29:55,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:29:55,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:29:55,909 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 22:29:55,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710258479] [2019-12-18 22:29:55,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:29:55,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 22:29:55,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082473628] [2019-12-18 22:29:55,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 22:29:55,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:29:55,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 22:29:55,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:29:55,911 INFO L87 Difference]: Start difference. First operand 42754 states and 139696 transitions. Second operand 6 states. [2019-12-18 22:29:56,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:29:56,921 INFO L93 Difference]: Finished difference Result 57202 states and 181936 transitions. [2019-12-18 22:29:56,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 22:29:56,922 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-12-18 22:29:56,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:29:57,014 INFO L225 Difference]: With dead ends: 57202 [2019-12-18 22:29:57,014 INFO L226 Difference]: Without dead ends: 57195 [2019-12-18 22:29:57,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-18 22:29:57,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57195 states. [2019-12-18 22:30:01,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57195 to 42770. [2019-12-18 22:30:01,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42770 states. [2019-12-18 22:30:01,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42770 states to 42770 states and 139617 transitions. [2019-12-18 22:30:01,230 INFO L78 Accepts]: Start accepts. Automaton has 42770 states and 139617 transitions. Word has length 19 [2019-12-18 22:30:01,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:30:01,231 INFO L462 AbstractCegarLoop]: Abstraction has 42770 states and 139617 transitions. [2019-12-18 22:30:01,231 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 22:30:01,231 INFO L276 IsEmpty]: Start isEmpty. Operand 42770 states and 139617 transitions. [2019-12-18 22:30:01,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 22:30:01,239 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:30:01,239 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] [2019-12-18 22:30:01,239 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 22:30:01,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:30:01,240 INFO L82 PathProgramCache]: Analyzing trace with hash -566010628, now seen corresponding path program 1 times [2019-12-18 22:30:01,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:30:01,240 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457198483] [2019-12-18 22:30:01,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:30:01,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:30:01,341 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 22:30:01,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457198483] [2019-12-18 22:30:01,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:30:01,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:30:01,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151774759] [2019-12-18 22:30:01,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:30:01,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:30:01,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:30:01,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:30:01,345 INFO L87 Difference]: Start difference. First operand 42770 states and 139617 transitions. Second operand 5 states. [2019-12-18 22:30:02,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:30:02,208 INFO L93 Difference]: Finished difference Result 53348 states and 170586 transitions. [2019-12-18 22:30:02,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 22:30:02,209 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-12-18 22:30:02,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:30:02,333 INFO L225 Difference]: With dead ends: 53348 [2019-12-18 22:30:02,333 INFO L226 Difference]: Without dead ends: 53341 [2019-12-18 22:30:02,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 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 22:30:02,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53341 states. [2019-12-18 22:30:03,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53341 to 42800. [2019-12-18 22:30:03,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42800 states. [2019-12-18 22:30:03,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42800 states to 42800 states and 139512 transitions. [2019-12-18 22:30:03,586 INFO L78 Accepts]: Start accepts. Automaton has 42800 states and 139512 transitions. Word has length 23 [2019-12-18 22:30:03,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:30:03,586 INFO L462 AbstractCegarLoop]: Abstraction has 42800 states and 139512 transitions. [2019-12-18 22:30:03,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:30:03,586 INFO L276 IsEmpty]: Start isEmpty. Operand 42800 states and 139512 transitions. [2019-12-18 22:30:03,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 22:30:03,599 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:30:03,599 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 22:30:03,599 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 22:30:03,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:30:03,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1356407650, now seen corresponding path program 1 times [2019-12-18 22:30:03,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:30:03,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409360544] [2019-12-18 22:30:03,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:30:03,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:30:03,673 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 22:30:03,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409360544] [2019-12-18 22:30:03,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:30:03,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:30:03,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559426932] [2019-12-18 22:30:03,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:30:03,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:30:03,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:30:03,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:30:03,675 INFO L87 Difference]: Start difference. First operand 42800 states and 139512 transitions. Second operand 4 states. [2019-12-18 22:30:03,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:30:03,719 INFO L93 Difference]: Finished difference Result 7928 states and 21510 transitions. [2019-12-18 22:30:03,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 22:30:03,720 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 22:30:03,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:30:03,733 INFO L225 Difference]: With dead ends: 7928 [2019-12-18 22:30:03,733 INFO L226 Difference]: Without dead ends: 7928 [2019-12-18 22:30:03,734 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 22:30:03,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7928 states. [2019-12-18 22:30:03,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7928 to 7788. [2019-12-18 22:30:03,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7788 states. [2019-12-18 22:30:03,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7788 states to 7788 states and 21138 transitions. [2019-12-18 22:30:03,872 INFO L78 Accepts]: Start accepts. Automaton has 7788 states and 21138 transitions. Word has length 25 [2019-12-18 22:30:03,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:30:03,873 INFO L462 AbstractCegarLoop]: Abstraction has 7788 states and 21138 transitions. [2019-12-18 22:30:03,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:30:03,873 INFO L276 IsEmpty]: Start isEmpty. Operand 7788 states and 21138 transitions. [2019-12-18 22:30:03,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 22:30:03,881 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:30:03,881 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] [2019-12-18 22:30:03,881 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 22:30:03,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:30:03,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1453764539, now seen corresponding path program 1 times [2019-12-18 22:30:03,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:30:03,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916980842] [2019-12-18 22:30:03,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:30:03,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:30:03,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:30:03,968 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916980842] [2019-12-18 22:30:03,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:30:03,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 22:30:03,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338791561] [2019-12-18 22:30:03,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:30:03,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:30:03,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:30:03,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:30:03,970 INFO L87 Difference]: Start difference. First operand 7788 states and 21138 transitions. Second operand 5 states. [2019-12-18 22:30:04,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:30:04,013 INFO L93 Difference]: Finished difference Result 5614 states and 15949 transitions. [2019-12-18 22:30:04,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:30:04,013 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-18 22:30:04,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:30:04,022 INFO L225 Difference]: With dead ends: 5614 [2019-12-18 22:30:04,022 INFO L226 Difference]: Without dead ends: 5218 [2019-12-18 22:30:04,023 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 22:30:04,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5218 states. [2019-12-18 22:30:04,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5218 to 4854. [2019-12-18 22:30:04,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4854 states. [2019-12-18 22:30:04,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4854 states to 4854 states and 14006 transitions. [2019-12-18 22:30:04,099 INFO L78 Accepts]: Start accepts. Automaton has 4854 states and 14006 transitions. Word has length 37 [2019-12-18 22:30:04,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:30:04,100 INFO L462 AbstractCegarLoop]: Abstraction has 4854 states and 14006 transitions. [2019-12-18 22:30:04,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:30:04,100 INFO L276 IsEmpty]: Start isEmpty. Operand 4854 states and 14006 transitions. [2019-12-18 22:30:04,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 22:30:04,108 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:30:04,109 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 22:30:04,109 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 22:30:04,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:30:04,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1228802019, now seen corresponding path program 1 times [2019-12-18 22:30:04,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:30:04,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408278336] [2019-12-18 22:30:04,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:30:04,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:30:04,181 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 22:30:04,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408278336] [2019-12-18 22:30:04,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:30:04,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:30:04,182 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984892193] [2019-12-18 22:30:04,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:30:04,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:30:04,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:30:04,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:30:04,184 INFO L87 Difference]: Start difference. First operand 4854 states and 14006 transitions. Second operand 3 states. [2019-12-18 22:30:04,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:30:04,245 INFO L93 Difference]: Finished difference Result 4863 states and 14015 transitions. [2019-12-18 22:30:04,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:30:04,246 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 22:30:04,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:30:04,254 INFO L225 Difference]: With dead ends: 4863 [2019-12-18 22:30:04,254 INFO L226 Difference]: Without dead ends: 4863 [2019-12-18 22:30:04,254 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 22:30:04,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4863 states. [2019-12-18 22:30:04,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4863 to 4859. [2019-12-18 22:30:04,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4859 states. [2019-12-18 22:30:04,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4859 states to 4859 states and 14011 transitions. [2019-12-18 22:30:04,359 INFO L78 Accepts]: Start accepts. Automaton has 4859 states and 14011 transitions. Word has length 65 [2019-12-18 22:30:04,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:30:04,359 INFO L462 AbstractCegarLoop]: Abstraction has 4859 states and 14011 transitions. [2019-12-18 22:30:04,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:30:04,359 INFO L276 IsEmpty]: Start isEmpty. Operand 4859 states and 14011 transitions. [2019-12-18 22:30:04,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 22:30:04,370 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:30:04,370 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 22:30:04,371 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 22:30:04,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:30:04,374 INFO L82 PathProgramCache]: Analyzing trace with hash 320653868, now seen corresponding path program 1 times [2019-12-18 22:30:04,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:30:04,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782844220] [2019-12-18 22:30:04,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:30:04,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:30:04,489 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 22:30:04,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782844220] [2019-12-18 22:30:04,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:30:04,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 22:30:04,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217762756] [2019-12-18 22:30:04,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:30:04,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:30:04,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:30:04,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:30:04,493 INFO L87 Difference]: Start difference. First operand 4859 states and 14011 transitions. Second operand 5 states. [2019-12-18 22:30:04,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:30:04,814 INFO L93 Difference]: Finished difference Result 7434 states and 21227 transitions. [2019-12-18 22:30:04,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 22:30:04,815 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-18 22:30:04,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:30:04,828 INFO L225 Difference]: With dead ends: 7434 [2019-12-18 22:30:04,828 INFO L226 Difference]: Without dead ends: 7434 [2019-12-18 22:30:04,829 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:30:04,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7434 states. [2019-12-18 22:30:04,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7434 to 6222. [2019-12-18 22:30:04,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6222 states. [2019-12-18 22:30:04,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6222 states to 6222 states and 17946 transitions. [2019-12-18 22:30:04,993 INFO L78 Accepts]: Start accepts. Automaton has 6222 states and 17946 transitions. Word has length 65 [2019-12-18 22:30:04,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:30:04,993 INFO L462 AbstractCegarLoop]: Abstraction has 6222 states and 17946 transitions. [2019-12-18 22:30:04,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:30:04,994 INFO L276 IsEmpty]: Start isEmpty. Operand 6222 states and 17946 transitions. [2019-12-18 22:30:05,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 22:30:05,006 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:30:05,007 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 22:30:05,007 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 22:30:05,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:30:05,007 INFO L82 PathProgramCache]: Analyzing trace with hash -2108512596, now seen corresponding path program 2 times [2019-12-18 22:30:05,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:30:05,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26400462] [2019-12-18 22:30:05,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:30:05,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:30:05,117 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 22:30:05,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26400462] [2019-12-18 22:30:05,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:30:05,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 22:30:05,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480922852] [2019-12-18 22:30:05,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:30:05,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:30:05,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:30:05,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:30:05,120 INFO L87 Difference]: Start difference. First operand 6222 states and 17946 transitions. Second operand 5 states. [2019-12-18 22:30:05,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:30:05,490 INFO L93 Difference]: Finished difference Result 9220 states and 26262 transitions. [2019-12-18 22:30:05,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 22:30:05,491 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-18 22:30:05,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:30:05,504 INFO L225 Difference]: With dead ends: 9220 [2019-12-18 22:30:05,505 INFO L226 Difference]: Without dead ends: 9220 [2019-12-18 22:30:05,505 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 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 22:30:05,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9220 states. [2019-12-18 22:30:05,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9220 to 6884. [2019-12-18 22:30:05,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6884 states. [2019-12-18 22:30:05,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6884 states to 6884 states and 19924 transitions. [2019-12-18 22:30:05,629 INFO L78 Accepts]: Start accepts. Automaton has 6884 states and 19924 transitions. Word has length 65 [2019-12-18 22:30:05,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:30:05,629 INFO L462 AbstractCegarLoop]: Abstraction has 6884 states and 19924 transitions. [2019-12-18 22:30:05,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:30:05,629 INFO L276 IsEmpty]: Start isEmpty. Operand 6884 states and 19924 transitions. [2019-12-18 22:30:05,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 22:30:05,640 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:30:05,640 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 22:30:05,640 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 22:30:05,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:30:05,640 INFO L82 PathProgramCache]: Analyzing trace with hash 27480750, now seen corresponding path program 3 times [2019-12-18 22:30:05,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:30:05,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682873690] [2019-12-18 22:30:05,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:30:05,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:30:05,731 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 22:30:05,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682873690] [2019-12-18 22:30:05,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:30:05,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 22:30:05,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345278378] [2019-12-18 22:30:05,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 22:30:05,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:30:05,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 22:30:05,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:30:05,734 INFO L87 Difference]: Start difference. First operand 6884 states and 19924 transitions. Second operand 6 states. [2019-12-18 22:30:06,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:30:06,262 INFO L93 Difference]: Finished difference Result 11140 states and 32001 transitions. [2019-12-18 22:30:06,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 22:30:06,262 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-18 22:30:06,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:30:06,279 INFO L225 Difference]: With dead ends: 11140 [2019-12-18 22:30:06,280 INFO L226 Difference]: Without dead ends: 11140 [2019-12-18 22:30:06,280 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 22:30:06,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11140 states. [2019-12-18 22:30:06,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11140 to 7495. [2019-12-18 22:30:06,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7495 states. [2019-12-18 22:30:06,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7495 states to 7495 states and 21745 transitions. [2019-12-18 22:30:06,408 INFO L78 Accepts]: Start accepts. Automaton has 7495 states and 21745 transitions. Word has length 65 [2019-12-18 22:30:06,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:30:06,408 INFO L462 AbstractCegarLoop]: Abstraction has 7495 states and 21745 transitions. [2019-12-18 22:30:06,408 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 22:30:06,408 INFO L276 IsEmpty]: Start isEmpty. Operand 7495 states and 21745 transitions. [2019-12-18 22:30:06,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 22:30:06,418 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:30:06,418 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 22:30:06,419 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 22:30:06,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:30:06,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1465472054, now seen corresponding path program 4 times [2019-12-18 22:30:06,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:30:06,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833720465] [2019-12-18 22:30:06,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:30:06,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:30:06,519 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 22:30:06,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833720465] [2019-12-18 22:30:06,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:30:06,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:30:06,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570871812] [2019-12-18 22:30:06,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:30:06,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:30:06,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:30:06,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:30:06,522 INFO L87 Difference]: Start difference. First operand 7495 states and 21745 transitions. Second operand 3 states. [2019-12-18 22:30:06,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:30:06,734 INFO L93 Difference]: Finished difference Result 7494 states and 21743 transitions. [2019-12-18 22:30:06,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:30:06,735 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 22:30:06,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:30:06,745 INFO L225 Difference]: With dead ends: 7494 [2019-12-18 22:30:06,746 INFO L226 Difference]: Without dead ends: 7494 [2019-12-18 22:30:06,751 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 22:30:06,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7494 states. [2019-12-18 22:30:06,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7494 to 4877. [2019-12-18 22:30:06,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4877 states. [2019-12-18 22:30:06,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4877 states to 4877 states and 14441 transitions. [2019-12-18 22:30:06,903 INFO L78 Accepts]: Start accepts. Automaton has 4877 states and 14441 transitions. Word has length 65 [2019-12-18 22:30:06,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:30:06,903 INFO L462 AbstractCegarLoop]: Abstraction has 4877 states and 14441 transitions. [2019-12-18 22:30:06,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:30:06,903 INFO L276 IsEmpty]: Start isEmpty. Operand 4877 states and 14441 transitions. [2019-12-18 22:30:06,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 22:30:06,914 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:30:06,914 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 22:30:06,914 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 22:30:06,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:30:06,915 INFO L82 PathProgramCache]: Analyzing trace with hash -337801162, now seen corresponding path program 1 times [2019-12-18 22:30:06,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:30:06,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455681413] [2019-12-18 22:30:06,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:30:06,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:30:06,996 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 22:30:06,997 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455681413] [2019-12-18 22:30:06,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:30:06,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:30:06,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353253736] [2019-12-18 22:30:06,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:30:06,998 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:30:06,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:30:06,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:30:06,998 INFO L87 Difference]: Start difference. First operand 4877 states and 14441 transitions. Second operand 3 states. [2019-12-18 22:30:07,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:30:07,027 INFO L93 Difference]: Finished difference Result 4491 states and 13003 transitions. [2019-12-18 22:30:07,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:30:07,027 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 22:30:07,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:30:07,034 INFO L225 Difference]: With dead ends: 4491 [2019-12-18 22:30:07,035 INFO L226 Difference]: Without dead ends: 4491 [2019-12-18 22:30:07,036 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 22:30:07,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4491 states. [2019-12-18 22:30:07,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4491 to 3739. [2019-12-18 22:30:07,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3739 states. [2019-12-18 22:30:07,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3739 states to 3739 states and 10867 transitions. [2019-12-18 22:30:07,108 INFO L78 Accepts]: Start accepts. Automaton has 3739 states and 10867 transitions. Word has length 66 [2019-12-18 22:30:07,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:30:07,108 INFO L462 AbstractCegarLoop]: Abstraction has 3739 states and 10867 transitions. [2019-12-18 22:30:07,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:30:07,108 INFO L276 IsEmpty]: Start isEmpty. Operand 3739 states and 10867 transitions. [2019-12-18 22:30:07,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 22:30:07,114 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:30:07,114 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, 1] [2019-12-18 22:30:07,114 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 22:30:07,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:30:07,114 INFO L82 PathProgramCache]: Analyzing trace with hash -347351168, now seen corresponding path program 1 times [2019-12-18 22:30:07,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:30:07,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777200238] [2019-12-18 22:30:07,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:30:07,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:30:07,205 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 22:30:07,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777200238] [2019-12-18 22:30:07,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:30:07,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 22:30:07,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132887542] [2019-12-18 22:30:07,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 22:30:07,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:30:07,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 22:30:07,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:30:07,207 INFO L87 Difference]: Start difference. First operand 3739 states and 10867 transitions. Second operand 6 states. [2019-12-18 22:30:07,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:30:07,763 INFO L93 Difference]: Finished difference Result 6465 states and 18382 transitions. [2019-12-18 22:30:07,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 22:30:07,763 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-12-18 22:30:07,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:30:07,773 INFO L225 Difference]: With dead ends: 6465 [2019-12-18 22:30:07,773 INFO L226 Difference]: Without dead ends: 6465 [2019-12-18 22:30:07,774 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-18 22:30:07,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6465 states. [2019-12-18 22:30:07,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6465 to 3739. [2019-12-18 22:30:07,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3739 states. [2019-12-18 22:30:07,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3739 states to 3739 states and 10867 transitions. [2019-12-18 22:30:07,846 INFO L78 Accepts]: Start accepts. Automaton has 3739 states and 10867 transitions. Word has length 67 [2019-12-18 22:30:07,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:30:07,846 INFO L462 AbstractCegarLoop]: Abstraction has 3739 states and 10867 transitions. [2019-12-18 22:30:07,846 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 22:30:07,846 INFO L276 IsEmpty]: Start isEmpty. Operand 3739 states and 10867 transitions. [2019-12-18 22:30:07,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 22:30:07,852 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:30:07,852 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, 1] [2019-12-18 22:30:07,852 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 22:30:07,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:30:07,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1909324032, now seen corresponding path program 2 times [2019-12-18 22:30:07,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:30:07,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151461041] [2019-12-18 22:30:07,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:30:07,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:30:07,982 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 22:30:07,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151461041] [2019-12-18 22:30:07,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:30:07,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 22:30:07,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967832966] [2019-12-18 22:30:07,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 22:30:07,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:30:07,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 22:30:07,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:30:07,985 INFO L87 Difference]: Start difference. First operand 3739 states and 10867 transitions. Second operand 7 states. [2019-12-18 22:30:08,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:30:08,116 INFO L93 Difference]: Finished difference Result 6971 states and 20283 transitions. [2019-12-18 22:30:08,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 22:30:08,117 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2019-12-18 22:30:08,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:30:08,124 INFO L225 Difference]: With dead ends: 6971 [2019-12-18 22:30:08,125 INFO L226 Difference]: Without dead ends: 3978 [2019-12-18 22:30:08,125 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-12-18 22:30:08,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3978 states. [2019-12-18 22:30:08,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3978 to 3405. [2019-12-18 22:30:08,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3405 states. [2019-12-18 22:30:08,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3405 states to 3405 states and 9885 transitions. [2019-12-18 22:30:08,179 INFO L78 Accepts]: Start accepts. Automaton has 3405 states and 9885 transitions. Word has length 67 [2019-12-18 22:30:08,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:30:08,179 INFO L462 AbstractCegarLoop]: Abstraction has 3405 states and 9885 transitions. [2019-12-18 22:30:08,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 22:30:08,179 INFO L276 IsEmpty]: Start isEmpty. Operand 3405 states and 9885 transitions. [2019-12-18 22:30:08,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 22:30:08,184 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:30:08,184 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, 1] [2019-12-18 22:30:08,185 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 22:30:08,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:30:08,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1990304176, now seen corresponding path program 3 times [2019-12-18 22:30:08,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:30:08,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260287305] [2019-12-18 22:30:08,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:30:08,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:30:08,506 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 22:30:08,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260287305] [2019-12-18 22:30:08,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:30:08,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 22:30:08,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084299001] [2019-12-18 22:30:08,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 22:30:08,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:30:08,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 22:30:08,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-18 22:30:08,510 INFO L87 Difference]: Start difference. First operand 3405 states and 9885 transitions. Second operand 13 states. [2019-12-18 22:30:09,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:30:09,389 INFO L93 Difference]: Finished difference Result 8057 states and 23315 transitions. [2019-12-18 22:30:09,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 22:30:09,389 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 67 [2019-12-18 22:30:09,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:30:09,402 INFO L225 Difference]: With dead ends: 8057 [2019-12-18 22:30:09,402 INFO L226 Difference]: Without dead ends: 8025 [2019-12-18 22:30:09,403 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=156, Invalid=714, Unknown=0, NotChecked=0, Total=870 [2019-12-18 22:30:09,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8025 states. [2019-12-18 22:30:09,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8025 to 4606. [2019-12-18 22:30:09,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4606 states. [2019-12-18 22:30:09,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4606 states to 4606 states and 13240 transitions. [2019-12-18 22:30:09,488 INFO L78 Accepts]: Start accepts. Automaton has 4606 states and 13240 transitions. Word has length 67 [2019-12-18 22:30:09,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:30:09,488 INFO L462 AbstractCegarLoop]: Abstraction has 4606 states and 13240 transitions. [2019-12-18 22:30:09,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 22:30:09,489 INFO L276 IsEmpty]: Start isEmpty. Operand 4606 states and 13240 transitions. [2019-12-18 22:30:09,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 22:30:09,493 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:30:09,493 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, 1] [2019-12-18 22:30:09,493 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 22:30:09,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:30:09,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1039202198, now seen corresponding path program 4 times [2019-12-18 22:30:09,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:30:09,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915760018] [2019-12-18 22:30:09,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:30:09,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:30:09,563 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 22:30:09,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915760018] [2019-12-18 22:30:09,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:30:09,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:30:09,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747285981] [2019-12-18 22:30:09,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:30:09,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:30:09,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:30:09,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:30:09,565 INFO L87 Difference]: Start difference. First operand 4606 states and 13240 transitions. Second operand 3 states. [2019-12-18 22:30:09,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:30:09,596 INFO L93 Difference]: Finished difference Result 4202 states and 11764 transitions. [2019-12-18 22:30:09,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:30:09,597 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-18 22:30:09,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:30:09,603 INFO L225 Difference]: With dead ends: 4202 [2019-12-18 22:30:09,604 INFO L226 Difference]: Without dead ends: 4202 [2019-12-18 22:30:09,604 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 22:30:09,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4202 states. [2019-12-18 22:30:09,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4202 to 3952. [2019-12-18 22:30:09,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3952 states. [2019-12-18 22:30:09,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3952 states to 3952 states and 11078 transitions. [2019-12-18 22:30:09,683 INFO L78 Accepts]: Start accepts. Automaton has 3952 states and 11078 transitions. Word has length 67 [2019-12-18 22:30:09,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:30:09,684 INFO L462 AbstractCegarLoop]: Abstraction has 3952 states and 11078 transitions. [2019-12-18 22:30:09,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:30:09,684 INFO L276 IsEmpty]: Start isEmpty. Operand 3952 states and 11078 transitions. [2019-12-18 22:30:09,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 22:30:09,689 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:30:09,690 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, 1, 1] [2019-12-18 22:30:09,690 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 22:30:09,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:30:09,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1307128750, now seen corresponding path program 1 times [2019-12-18 22:30:09,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:30:09,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301946523] [2019-12-18 22:30:09,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:30:09,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:30:10,955 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 22:30:10,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301946523] [2019-12-18 22:30:10,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:30:10,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-12-18 22:30:10,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928889449] [2019-12-18 22:30:10,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-18 22:30:10,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:30:10,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-18 22:30:10,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2019-12-18 22:30:10,957 INFO L87 Difference]: Start difference. First operand 3952 states and 11078 transitions. Second operand 23 states. [2019-12-18 22:30:20,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:30:20,806 INFO L93 Difference]: Finished difference Result 13954 states and 39532 transitions. [2019-12-18 22:30:20,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-12-18 22:30:20,806 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 68 [2019-12-18 22:30:20,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:30:20,824 INFO L225 Difference]: With dead ends: 13954 [2019-12-18 22:30:20,825 INFO L226 Difference]: Without dead ends: 13922 [2019-12-18 22:30:20,827 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 2 SyntacticMatches, 7 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3225 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=1198, Invalid=9104, Unknown=0, NotChecked=0, Total=10302 [2019-12-18 22:30:20,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13922 states. [2019-12-18 22:30:20,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13922 to 4590. [2019-12-18 22:30:20,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4590 states. [2019-12-18 22:30:20,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4590 states to 4590 states and 12866 transitions. [2019-12-18 22:30:20,939 INFO L78 Accepts]: Start accepts. Automaton has 4590 states and 12866 transitions. Word has length 68 [2019-12-18 22:30:20,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:30:20,939 INFO L462 AbstractCegarLoop]: Abstraction has 4590 states and 12866 transitions. [2019-12-18 22:30:20,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-18 22:30:20,939 INFO L276 IsEmpty]: Start isEmpty. Operand 4590 states and 12866 transitions. [2019-12-18 22:30:20,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 22:30:20,943 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:30:20,943 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, 1, 1] [2019-12-18 22:30:20,944 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 22:30:20,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:30:20,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1207467558, now seen corresponding path program 2 times [2019-12-18 22:30:20,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:30:20,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641589429] [2019-12-18 22:30:20,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:30:20,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:30:21,246 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 22:30:21,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641589429] [2019-12-18 22:30:21,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:30:21,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 22:30:21,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176787228] [2019-12-18 22:30:21,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 22:30:21,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:30:21,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 22:30:21,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-18 22:30:21,248 INFO L87 Difference]: Start difference. First operand 4590 states and 12866 transitions. Second operand 12 states. [2019-12-18 22:30:21,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:30:21,720 INFO L93 Difference]: Finished difference Result 6953 states and 19424 transitions. [2019-12-18 22:30:21,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 22:30:21,721 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 68 [2019-12-18 22:30:21,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:30:21,731 INFO L225 Difference]: With dead ends: 6953 [2019-12-18 22:30:21,731 INFO L226 Difference]: Without dead ends: 6921 [2019-12-18 22:30:21,731 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2019-12-18 22:30:21,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6921 states. [2019-12-18 22:30:21,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6921 to 3948. [2019-12-18 22:30:21,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3948 states. [2019-12-18 22:30:21,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3948 states to 3948 states and 11039 transitions. [2019-12-18 22:30:21,797 INFO L78 Accepts]: Start accepts. Automaton has 3948 states and 11039 transitions. Word has length 68 [2019-12-18 22:30:21,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:30:21,797 INFO L462 AbstractCegarLoop]: Abstraction has 3948 states and 11039 transitions. [2019-12-18 22:30:21,797 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 22:30:21,798 INFO L276 IsEmpty]: Start isEmpty. Operand 3948 states and 11039 transitions. [2019-12-18 22:30:21,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 22:30:21,801 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:30:21,801 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, 1, 1] [2019-12-18 22:30:21,801 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 22:30:21,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:30:21,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1086450056, now seen corresponding path program 3 times [2019-12-18 22:30:21,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:30:21,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925532339] [2019-12-18 22:30:21,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:30:21,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:30:22,789 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 22:30:22,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925532339] [2019-12-18 22:30:22,790 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:30:22,790 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-12-18 22:30:22,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323479685] [2019-12-18 22:30:22,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-18 22:30:22,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:30:22,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-18 22:30:22,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2019-12-18 22:30:22,792 INFO L87 Difference]: Start difference. First operand 3948 states and 11039 transitions. Second operand 22 states. [2019-12-18 22:30:26,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:30:26,479 INFO L93 Difference]: Finished difference Result 10722 states and 30029 transitions. [2019-12-18 22:30:26,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-12-18 22:30:26,480 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 68 [2019-12-18 22:30:26,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:30:26,494 INFO L225 Difference]: With dead ends: 10722 [2019-12-18 22:30:26,494 INFO L226 Difference]: Without dead ends: 10690 [2019-12-18 22:30:26,495 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 705 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=428, Invalid=2542, Unknown=0, NotChecked=0, Total=2970 [2019-12-18 22:30:26,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10690 states. [2019-12-18 22:30:26,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10690 to 4245. [2019-12-18 22:30:26,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4245 states. [2019-12-18 22:30:26,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4245 states to 4245 states and 11861 transitions. [2019-12-18 22:30:26,587 INFO L78 Accepts]: Start accepts. Automaton has 4245 states and 11861 transitions. Word has length 68 [2019-12-18 22:30:26,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:30:26,587 INFO L462 AbstractCegarLoop]: Abstraction has 4245 states and 11861 transitions. [2019-12-18 22:30:26,587 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-18 22:30:26,587 INFO L276 IsEmpty]: Start isEmpty. Operand 4245 states and 11861 transitions. [2019-12-18 22:30:26,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 22:30:26,593 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:30:26,593 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, 1, 1] [2019-12-18 22:30:26,593 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 22:30:26,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:30:26,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1428146252, now seen corresponding path program 4 times [2019-12-18 22:30:26,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:30:26,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102399876] [2019-12-18 22:30:26,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:30:26,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:30:26,909 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 22:30:26,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102399876] [2019-12-18 22:30:26,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:30:26,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 22:30:26,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878330116] [2019-12-18 22:30:26,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 22:30:26,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:30:26,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 22:30:26,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-12-18 22:30:26,911 INFO L87 Difference]: Start difference. First operand 4245 states and 11861 transitions. Second operand 13 states. [2019-12-18 22:30:27,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:30:27,503 INFO L93 Difference]: Finished difference Result 7235 states and 20205 transitions. [2019-12-18 22:30:27,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 22:30:27,504 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 68 [2019-12-18 22:30:27,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:30:27,515 INFO L225 Difference]: With dead ends: 7235 [2019-12-18 22:30:27,515 INFO L226 Difference]: Without dead ends: 7203 [2019-12-18 22:30:27,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2019-12-18 22:30:27,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7203 states. [2019-12-18 22:30:27,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7203 to 4160. [2019-12-18 22:30:27,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4160 states. [2019-12-18 22:30:27,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4160 states to 4160 states and 11656 transitions. [2019-12-18 22:30:27,592 INFO L78 Accepts]: Start accepts. Automaton has 4160 states and 11656 transitions. Word has length 68 [2019-12-18 22:30:27,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:30:27,593 INFO L462 AbstractCegarLoop]: Abstraction has 4160 states and 11656 transitions. [2019-12-18 22:30:27,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 22:30:27,593 INFO L276 IsEmpty]: Start isEmpty. Operand 4160 states and 11656 transitions. [2019-12-18 22:30:27,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 22:30:27,597 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:30:27,597 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, 1, 1] [2019-12-18 22:30:27,597 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 22:30:27,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:30:27,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1871389806, now seen corresponding path program 5 times [2019-12-18 22:30:27,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:30:27,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084479680] [2019-12-18 22:30:27,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:30:27,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:30:28,024 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 22:30:28,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084479680] [2019-12-18 22:30:28,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:30:28,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 22:30:28,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975421521] [2019-12-18 22:30:28,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 22:30:28,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:30:28,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 22:30:28,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-12-18 22:30:28,026 INFO L87 Difference]: Start difference. First operand 4160 states and 11656 transitions. Second operand 16 states. [2019-12-18 22:30:29,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:30:29,317 INFO L93 Difference]: Finished difference Result 8366 states and 23473 transitions. [2019-12-18 22:30:29,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-18 22:30:29,318 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 68 [2019-12-18 22:30:29,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:30:29,329 INFO L225 Difference]: With dead ends: 8366 [2019-12-18 22:30:29,329 INFO L226 Difference]: Without dead ends: 8334 [2019-12-18 22:30:29,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=282, Invalid=1124, Unknown=0, NotChecked=0, Total=1406 [2019-12-18 22:30:29,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8334 states. [2019-12-18 22:30:29,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8334 to 4752. [2019-12-18 22:30:29,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4752 states. [2019-12-18 22:30:29,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4752 states to 4752 states and 13424 transitions. [2019-12-18 22:30:29,405 INFO L78 Accepts]: Start accepts. Automaton has 4752 states and 13424 transitions. Word has length 68 [2019-12-18 22:30:29,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:30:29,405 INFO L462 AbstractCegarLoop]: Abstraction has 4752 states and 13424 transitions. [2019-12-18 22:30:29,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 22:30:29,405 INFO L276 IsEmpty]: Start isEmpty. Operand 4752 states and 13424 transitions. [2019-12-18 22:30:29,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 22:30:29,409 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:30:29,409 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, 1, 1] [2019-12-18 22:30:29,409 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 22:30:29,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:30:29,409 INFO L82 PathProgramCache]: Analyzing trace with hash 380679096, now seen corresponding path program 6 times [2019-12-18 22:30:29,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:30:29,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568590657] [2019-12-18 22:30:29,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:30:29,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:30:29,757 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 22:30:29,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568590657] [2019-12-18 22:30:29,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:30:29,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 22:30:29,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919074140] [2019-12-18 22:30:29,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 22:30:29,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:30:29,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 22:30:29,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-12-18 22:30:29,760 INFO L87 Difference]: Start difference. First operand 4752 states and 13424 transitions. Second operand 13 states. [2019-12-18 22:30:30,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:30:30,448 INFO L93 Difference]: Finished difference Result 9399 states and 26703 transitions. [2019-12-18 22:30:30,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 22:30:30,448 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 68 [2019-12-18 22:30:30,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:30:30,462 INFO L225 Difference]: With dead ends: 9399 [2019-12-18 22:30:30,463 INFO L226 Difference]: Without dead ends: 9367 [2019-12-18 22:30:30,463 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=197, Invalid=733, Unknown=0, NotChecked=0, Total=930 [2019-12-18 22:30:30,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9367 states. [2019-12-18 22:30:30,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9367 to 5016. [2019-12-18 22:30:30,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5016 states. [2019-12-18 22:30:30,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5016 states to 5016 states and 14192 transitions. [2019-12-18 22:30:30,551 INFO L78 Accepts]: Start accepts. Automaton has 5016 states and 14192 transitions. Word has length 68 [2019-12-18 22:30:30,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:30:30,551 INFO L462 AbstractCegarLoop]: Abstraction has 5016 states and 14192 transitions. [2019-12-18 22:30:30,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 22:30:30,551 INFO L276 IsEmpty]: Start isEmpty. Operand 5016 states and 14192 transitions. [2019-12-18 22:30:30,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 22:30:30,556 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:30:30,556 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, 1, 1] [2019-12-18 22:30:30,556 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 22:30:30,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:30:30,556 INFO L82 PathProgramCache]: Analyzing trace with hash 158566424, now seen corresponding path program 7 times [2019-12-18 22:30:30,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:30:30,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671297209] [2019-12-18 22:30:30,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:30:30,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 22:30:30,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 22:30:30,677 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 22:30:30,677 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 22:30:30,681 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [822] [822] ULTIMATE.startENTRY-->L807: Formula: (let ((.cse0 (store |v_#valid_66| 0 0))) (and (= v_~main$tmp_guard0~0_10 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1973~0.base_22| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1973~0.base_22|) |v_ULTIMATE.start_main_~#t1973~0.offset_16| 0)) |v_#memory_int_21|) (= v_~z$r_buff0_thd3~0_20 0) (= |v_#NULL.offset_3| 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1973~0.base_22|)) (= v_~z$r_buff0_thd2~0_20 0) (= 0 v_~__unbuffered_cnt~0_21) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t1973~0.base_22| 4) |v_#length_23|) (= 0 v_~weak$$choice2~0_32) (= v_~x~0_10 0) (= 0 v_~z$flush_delayed~0_15) (= v_~z$read_delayed_var~0.offset_7 0) (= 0 v_~__unbuffered_p1_EAX~0_10) (= 0 v_~z$r_buff1_thd2~0_16) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1973~0.base_22|) (< 0 |v_#StackHeapBarrier_18|) (= v_~z$r_buff0_thd1~0_25 0) (= 0 v_~__unbuffered_p2_EAX~0_10) (= 0 v_~weak$$choice0~0_7) (= |v_#valid_64| (store .cse0 |v_ULTIMATE.start_main_~#t1973~0.base_22| 1)) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= v_~z$mem_tmp~0_10 0) (= 0 v_~y~0_8) (= 0 |v_#NULL.base_3|) (= 0 v_~z$w_buff0~0_28) (= 0 v_~z$r_buff1_thd1~0_19) (= v_~z$r_buff0_thd0~0_77 0) (= 0 |v_ULTIMATE.start_main_~#t1973~0.offset_16|) (= 0 v_~z$w_buff1_used~0_69) (= v_~main$tmp_guard1~0_13 0) (= 0 v_~z$r_buff1_thd0~0_46) (= v_~z~0_29 0) (= 0 v_~z$w_buff1~0_26) (= 0 v_~z$r_buff1_thd3~0_17) (= v_~z$w_buff0_used~0_116 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_7|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_9|, ULTIMATE.start_main_~#t1974~0.offset=|v_ULTIMATE.start_main_~#t1974~0.offset_15|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_16, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_11|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_14|, #NULL.offset=|v_#NULL.offset_3|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_9|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_12|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_12|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_11|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_14|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_14|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_77, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ~z$mem_tmp~0=v_~z$mem_tmp~0_10, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_8|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_11|, ULTIMATE.start_main_~#t1975~0.offset=|v_ULTIMATE.start_main_~#t1975~0.offset_15|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_14|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_69, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_12|, ~z$flush_delayed~0=v_~z$flush_delayed~0_15, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_11|, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ULTIMATE.start_main_~#t1975~0.base=|v_ULTIMATE.start_main_~#t1975~0.base_19|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_19, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_20, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~x~0=v_~x~0_10, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_7|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_9|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_11|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_12|, ~z$w_buff1~0=v_~z$w_buff1~0_26, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_9|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_15|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_11|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_14|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_11|, ULTIMATE.start_main_~#t1973~0.offset=|v_ULTIMATE.start_main_~#t1973~0.offset_16|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_46, ~y~0=v_~y~0_8, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_20, ULTIMATE.start_main_~#t1974~0.base=|v_ULTIMATE.start_main_~#t1974~0.base_20|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_7|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_7|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_28, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_17, ULTIMATE.start_main_~#t1973~0.base=|v_ULTIMATE.start_main_~#t1973~0.base_22|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_11|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_14|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_11|, #NULL.base=|v_#NULL.base_3|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_12|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_14|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_29, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_25} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_~#t1974~0.offset, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_~#t1975~0.offset, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t1975~0.base, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_#t~nondet31, ULTIMATE.start_main_#t~ite29, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite51, ULTIMATE.start_main_~#t1973~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t1974~0.base, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet23, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_~#t1973~0.base, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 22:30:30,682 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L807-1-->L809: Formula: (and (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t1974~0.base_11| 4) |v_#length_17|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1974~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1974~0.base_11|) |v_ULTIMATE.start_main_~#t1974~0.offset_10| 1)) |v_#memory_int_15|) (= 0 |v_ULTIMATE.start_main_~#t1974~0.offset_10|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1974~0.base_11|) (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t1974~0.base_11| 1)) (not (= |v_ULTIMATE.start_main_~#t1974~0.base_11| 0)) (= 0 (select |v_#valid_36| |v_ULTIMATE.start_main_~#t1974~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_4|, ULTIMATE.start_main_~#t1974~0.offset=|v_ULTIMATE.start_main_~#t1974~0.offset_10|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1974~0.base=|v_ULTIMATE.start_main_~#t1974~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_~#t1974~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1974~0.base] because there is no mapped edge [2019-12-18 22:30:30,682 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] P0ENTRY-->L4-3: Formula: (and (= v_~z$w_buff0~0_17 v_~z$w_buff1~0_16) (= (mod v_~z$w_buff1_used~0_56 256) 0) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= 2 v_~z$w_buff0~0_16) (= v_P0Thread1of1ForFork0_~arg.offset_4 |v_P0Thread1of1ForFork0_#in~arg.offset_4|) (= v_~z$w_buff0_used~0_89 1) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_8 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= v_P0Thread1of1ForFork0_~arg.base_4 |v_P0Thread1of1ForFork0_#in~arg.base_4|) (= v_~z$w_buff0_used~0_90 v_~z$w_buff1_used~0_56)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_90, ~z$w_buff0~0=v_~z$w_buff0~0_17, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_89, ~z$w_buff0~0=v_~z$w_buff0~0_16, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_8, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_56, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|, ~z$w_buff1~0=v_~z$w_buff1~0_16, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_4, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_4} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1_used~0, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-18 22:30:30,684 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L809-1-->L811: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t1975~0.offset_10|) (not (= 0 |v_ULTIMATE.start_main_~#t1975~0.base_12|)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1975~0.base_12|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1975~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1975~0.base_12|) |v_ULTIMATE.start_main_~#t1975~0.offset_10| 2)) |v_#memory_int_13|) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t1975~0.base_12| 1)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1975~0.base_12| 4)) (= (select |v_#valid_32| |v_ULTIMATE.start_main_~#t1975~0.base_12|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, ULTIMATE.start_main_~#t1975~0.base=|v_ULTIMATE.start_main_~#t1975~0.base_12|, ULTIMATE.start_main_~#t1975~0.offset=|v_ULTIMATE.start_main_~#t1975~0.offset_10|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_~#t1975~0.base, ULTIMATE.start_main_~#t1975~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-18 22:30:30,684 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L745-->L745-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd1~0_In-1122558343 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-1122558343 256) 0))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-1122558343| 0)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out-1122558343| ~z$w_buff0_used~0_In-1122558343) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1122558343, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1122558343} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1122558343|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1122558343, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1122558343} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 22:30:30,685 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L746-->L746-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd1~0_In-1821480581 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1821480581 256))) (.cse2 (= (mod ~z$r_buff0_thd1~0_In-1821480581 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1821480581 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-1821480581|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-1821480581 |P0Thread1of1ForFork0_#t~ite6_Out-1821480581|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1821480581, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1821480581, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1821480581, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1821480581} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1821480581|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1821480581, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1821480581, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1821480581, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1821480581} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 22:30:30,686 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L747-->L748: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-1490306030 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-1490306030 256) 0))) (or (and (= ~z$r_buff0_thd1~0_In-1490306030 ~z$r_buff0_thd1~0_Out-1490306030) (or .cse0 .cse1)) (and (= 0 ~z$r_buff0_thd1~0_Out-1490306030) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1490306030, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1490306030} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1490306030, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1490306030|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-1490306030} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 22:30:30,686 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L748-->L748-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In469099069 256))) (.cse2 (= (mod ~z$r_buff0_thd1~0_In469099069 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In469099069 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd1~0_In469099069 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite8_Out469099069| ~z$r_buff1_thd1~0_In469099069)) (and (= |P0Thread1of1ForFork0_#t~ite8_Out469099069| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In469099069, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In469099069, ~z$w_buff1_used~0=~z$w_buff1_used~0_In469099069, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In469099069} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In469099069, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out469099069|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In469099069, ~z$w_buff1_used~0=~z$w_buff1_used~0_In469099069, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In469099069} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 22:30:30,686 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L748-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~z$r_buff1_thd1~0_14)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_14, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 22:30:30,687 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L764-2-->L764-4: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In2125777187 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd2~0_In2125777187 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite9_Out2125777187| ~z~0_In2125777187)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite9_Out2125777187| ~z$w_buff1~0_In2125777187) (not .cse0)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In2125777187, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2125777187, ~z$w_buff1~0=~z$w_buff1~0_In2125777187, ~z~0=~z~0_In2125777187} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out2125777187|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In2125777187, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2125777187, ~z$w_buff1~0=~z$w_buff1~0_In2125777187, ~z~0=~z~0_In2125777187} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-18 22:30:30,687 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L764-4-->L765: Formula: (= |v_P1Thread1of1ForFork1_#t~ite9_8| v_~z~0_20) InVars {P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_8|} OutVars{P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_7|, P1Thread1of1ForFork1_#t~ite10=|v_P1Thread1of1ForFork1_#t~ite10_7|, ~z~0=v_~z~0_20} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10, ~z~0] because there is no mapped edge [2019-12-18 22:30:30,688 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L765-->L765-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In1565603977 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In1565603977 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out1565603977| ~z$w_buff0_used~0_In1565603977)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out1565603977| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1565603977, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1565603977} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1565603977, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out1565603977|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1565603977} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 22:30:30,688 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L784-2-->L784-4: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd3~0_In-1584112038 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In-1584112038 256) 0))) (or (and (or .cse0 .cse1) (= ~z~0_In-1584112038 |P2Thread1of1ForFork2_#t~ite15_Out-1584112038|)) (and (not .cse1) (= ~z$w_buff1~0_In-1584112038 |P2Thread1of1ForFork2_#t~ite15_Out-1584112038|) (not .cse0)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1584112038, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1584112038, ~z$w_buff1~0=~z$w_buff1~0_In-1584112038, ~z~0=~z~0_In-1584112038} OutVars{P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out-1584112038|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1584112038, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1584112038, ~z$w_buff1~0=~z$w_buff1~0_In-1584112038, ~z~0=~z~0_In-1584112038} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-18 22:30:30,689 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L766-->L766-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In1206609116 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In1206609116 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In1206609116 256))) (.cse3 (= (mod ~z$r_buff0_thd2~0_In1206609116 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite12_Out1206609116| 0)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In1206609116 |P1Thread1of1ForFork1_#t~ite12_Out1206609116|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1206609116, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1206609116, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1206609116, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1206609116} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1206609116, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1206609116, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1206609116, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out1206609116|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1206609116} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 22:30:30,689 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L767-->L767-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In1455625829 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In1455625829 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd2~0_In1455625829 |P1Thread1of1ForFork1_#t~ite13_Out1455625829|)) (and (= 0 |P1Thread1of1ForFork1_#t~ite13_Out1455625829|) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1455625829, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1455625829} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1455625829, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out1455625829|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1455625829} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-18 22:30:30,690 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L784-4-->L785: Formula: (= |v_P2Thread1of1ForFork2_#t~ite15_8| v_~z~0_21) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_8|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_7|, ~z~0=v_~z~0_21, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, ~z~0, P2Thread1of1ForFork2_#t~ite16] because there is no mapped edge [2019-12-18 22:30:30,690 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L785-->L785-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In794481998 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In794481998 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite17_Out794481998| ~z$w_buff0_used~0_In794481998)) (and (= |P2Thread1of1ForFork2_#t~ite17_Out794481998| 0) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In794481998, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In794481998} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In794481998, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In794481998, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out794481998|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-18 22:30:30,690 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L786-->L786-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In2123139985 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In2123139985 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In2123139985 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In2123139985 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite18_Out2123139985| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P2Thread1of1ForFork2_#t~ite18_Out2123139985| ~z$w_buff1_used~0_In2123139985) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2123139985, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2123139985, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2123139985, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2123139985} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2123139985, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2123139985, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2123139985, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2123139985, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out2123139985|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-18 22:30:30,691 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L787-->L787-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In1557471953 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In1557471953 256) 0))) (or (and (= ~z$r_buff0_thd3~0_In1557471953 |P2Thread1of1ForFork2_#t~ite19_Out1557471953|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite19_Out1557471953|) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1557471953, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1557471953} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1557471953, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1557471953, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out1557471953|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-18 22:30:30,691 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L788-->L788-2: Formula: (let ((.cse2 (= (mod ~z$r_buff0_thd3~0_In1794474442 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In1794474442 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In1794474442 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In1794474442 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd3~0_In1794474442 |P2Thread1of1ForFork2_#t~ite20_Out1794474442|)) (and (= 0 |P2Thread1of1ForFork2_#t~ite20_Out1794474442|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1794474442, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1794474442, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1794474442, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1794474442} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1794474442, P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out1794474442|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1794474442, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1794474442, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1794474442} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-18 22:30:30,691 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L788-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= |v_P2Thread1of1ForFork2_#t~ite20_8| v_~z$r_buff1_thd3~0_12)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_12, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, ~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-18 22:30:30,692 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L768-->L768-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In-137194860 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-137194860 256))) (.cse3 (= (mod ~z$r_buff0_thd2~0_In-137194860 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-137194860 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite14_Out-137194860| ~z$r_buff1_thd2~0_In-137194860)) (and (= |P1Thread1of1ForFork1_#t~ite14_Out-137194860| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-137194860, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-137194860, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-137194860, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-137194860} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-137194860, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-137194860, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-137194860, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-137194860|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-137194860} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 22:30:30,692 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L768-2-->P1EXIT: Formula: (and (= v_~z$r_buff1_thd2~0_10 |v_P1Thread1of1ForFork1_#t~ite14_8|) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_10, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_7|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 22:30:30,692 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L811-1-->L817: Formula: (and (= v_~__unbuffered_cnt~0_9 3) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 22:30:30,692 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L817-2-->L817-4: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In559452093 256))) (.cse0 (= (mod ~z$r_buff1_thd0~0_In559452093 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite24_Out559452093| ~z$w_buff1~0_In559452093) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite24_Out559452093| ~z~0_In559452093) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In559452093, ~z$w_buff1_used~0=~z$w_buff1_used~0_In559452093, ~z$w_buff1~0=~z$w_buff1~0_In559452093, ~z~0=~z~0_In559452093} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In559452093, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out559452093|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In559452093, ~z$w_buff1~0=~z$w_buff1~0_In559452093, ~z~0=~z~0_In559452093} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-18 22:30:30,693 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L817-4-->L818: Formula: (= v_~z~0_17 |v_ULTIMATE.start_main_#t~ite24_7|) InVars {ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_7|} OutVars{ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_6|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_6|, ~z~0=v_~z~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25, ~z~0] because there is no mapped edge [2019-12-18 22:30:30,693 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L818-->L818-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1776044800 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1776044800 256)))) (or (and (= |ULTIMATE.start_main_#t~ite26_Out1776044800| ~z$w_buff0_used~0_In1776044800) (or .cse0 .cse1)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite26_Out1776044800|) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1776044800, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1776044800} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1776044800, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1776044800, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out1776044800|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-18 22:30:30,693 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L819-->L819-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In925672127 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In925672127 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In925672127 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In925672127 256)))) (or (and (= |ULTIMATE.start_main_#t~ite27_Out925672127| ~z$w_buff1_used~0_In925672127) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite27_Out925672127| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In925672127, ~z$w_buff0_used~0=~z$w_buff0_used~0_In925672127, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In925672127, ~z$w_buff1_used~0=~z$w_buff1_used~0_In925672127} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In925672127, ~z$w_buff0_used~0=~z$w_buff0_used~0_In925672127, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In925672127, ~z$w_buff1_used~0=~z$w_buff1_used~0_In925672127, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out925672127|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-18 22:30:30,694 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L820-->L820-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1890721979 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In1890721979 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite28_Out1890721979| 0)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite28_Out1890721979| ~z$r_buff0_thd0~0_In1890721979)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1890721979, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1890721979} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1890721979, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out1890721979|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1890721979} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-18 22:30:30,694 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L821-->L821-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In2068828325 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In2068828325 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In2068828325 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In2068828325 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite29_Out2068828325|)) (and (or .cse0 .cse1) (= ~z$r_buff1_thd0~0_In2068828325 |ULTIMATE.start_main_#t~ite29_Out2068828325|) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2068828325, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2068828325, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2068828325, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2068828325} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2068828325, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out2068828325|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2068828325, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2068828325, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2068828325} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-18 22:30:30,699 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L833-->L834: Formula: (and (not (= (mod v_~weak$$choice2~0_27 256) 0)) (= v_~z$r_buff0_thd0~0_69 v_~z$r_buff0_thd0~0_70)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_70, ~weak$$choice2~0=v_~weak$$choice2~0_27} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_69, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_8|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_7|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_8|, ~weak$$choice2~0=v_~weak$$choice2~0_27} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 22:30:30,700 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L836-->L4: Formula: (and (= 0 v_~z$flush_delayed~0_10) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4| (mod v_~main$tmp_guard1~0_8 256)) (not (= (mod v_~z$flush_delayed~0_11 256) 0)) (= v_~z~0_25 v_~z$mem_tmp~0_7)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~z$flush_delayed~0=v_~z$flush_delayed~0_11} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_7, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_9|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~z$flush_delayed~0=v_~z$flush_delayed~0_10, ~z~0=v_~z~0_25, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 22:30:30,700 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 22:30:30,810 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 10:30:30 BasicIcfg [2019-12-18 22:30:30,810 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 22:30:30,811 INFO L168 Benchmark]: Toolchain (without parser) took 129279.31 ms. Allocated memory was 145.2 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 100.1 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-18 22:30:30,812 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-18 22:30:30,813 INFO L168 Benchmark]: CACSL2BoogieTranslator took 793.12 ms. Allocated memory was 145.2 MB in the beginning and 201.3 MB in the end (delta: 56.1 MB). Free memory was 99.7 MB in the beginning and 155.0 MB in the end (delta: -55.3 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. [2019-12-18 22:30:30,813 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.66 ms. Allocated memory is still 201.3 MB. Free memory was 154.3 MB in the beginning and 151.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 22:30:30,814 INFO L168 Benchmark]: Boogie Preprocessor took 39.00 ms. Allocated memory is still 201.3 MB. Free memory was 151.7 MB in the beginning and 149.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 22:30:30,814 INFO L168 Benchmark]: RCFGBuilder took 819.43 ms. Allocated memory is still 201.3 MB. Free memory was 149.1 MB in the beginning and 99.0 MB in the end (delta: 50.1 MB). Peak memory consumption was 50.1 MB. Max. memory is 7.1 GB. [2019-12-18 22:30:30,815 INFO L168 Benchmark]: TraceAbstraction took 127554.59 ms. Allocated memory was 201.3 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 99.0 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2019-12-18 22:30:30,822 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.19 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 793.12 ms. Allocated memory was 145.2 MB in the beginning and 201.3 MB in the end (delta: 56.1 MB). Free memory was 99.7 MB in the beginning and 155.0 MB in the end (delta: -55.3 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 67.66 ms. Allocated memory is still 201.3 MB. Free memory was 154.3 MB in the beginning and 151.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.00 ms. Allocated memory is still 201.3 MB. Free memory was 151.7 MB in the beginning and 149.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 819.43 ms. Allocated memory is still 201.3 MB. Free memory was 149.1 MB in the beginning and 99.0 MB in the end (delta: 50.1 MB). Peak memory consumption was 50.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 127554.59 ms. Allocated memory was 201.3 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 99.0 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.7s, 175 ProgramPointsBefore, 98 ProgramPointsAfterwards, 212 TransitionsBefore, 111 TransitionsAfterwards, 17114 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 28 ChoiceCompositions, 5348 VarBasedMoverChecksPositive, 177 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 84694 CheckedPairsTotal, 109 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L807] FCALL, FORK 0 pthread_create(&t1973, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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] [L734] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L735] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L736] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L737] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L738] 1 z$r_buff0_thd1 = (_Bool)1 [L741] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] 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, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L809] FCALL, FORK 0 pthread_create(&t1974, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] 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) [L745] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L746] 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 [L811] FCALL, FORK 0 pthread_create(&t1975, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L758] 2 __unbuffered_p1_EAX = x [L761] 2 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L764] 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=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L778] 3 __unbuffered_p2_EAX = y [L781] 3 z = 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=2] [L784] 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=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L765] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L766] 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 [L767] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L785] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L786] 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 [L787] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L817] 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=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L818] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L819] 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 [L820] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L821] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L824] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L825] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L826] 0 z$flush_delayed = weak$$choice2 [L827] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, 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=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L828] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, 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=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L828] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L829] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, 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=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L829] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L830] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, 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=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L830] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L831] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, 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=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L831] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L832] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, 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=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L832] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L834] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, 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=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L834] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L835] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, 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=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 166 locations, 2 error locations. Result: UNSAFE, OverallTime: 127.2s, OverallIterations: 25, TraceHistogramMax: 1, AutomataDifference: 42.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4099 SDtfs, 6441 SDslu, 14963 SDs, 0 SdLazy, 14593 SolverSat, 585 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 417 GetRequests, 36 SyntacticMatches, 31 SemanticMatches, 350 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4672 ImplicationChecksByTransitivity, 9.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=221154occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 52.9s AutomataMinimizationTime, 24 MinimizatonAttempts, 127858 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 1279 NumberOfCodeBlocks, 1279 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1187 ConstructedInterpolants, 0 QuantifiedInterpolants, 475226 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 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...