/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix034_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 16:48:37,315 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 16:48:37,318 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 16:48:37,337 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 16:48:37,337 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 16:48:37,339 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 16:48:37,341 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 16:48:37,344 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 16:48:37,346 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 16:48:37,347 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 16:48:37,348 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 16:48:37,349 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 16:48:37,349 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 16:48:37,350 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 16:48:37,351 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 16:48:37,353 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 16:48:37,353 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 16:48:37,355 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 16:48:37,356 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 16:48:37,358 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 16:48:37,360 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 16:48:37,361 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 16:48:37,362 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 16:48:37,363 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 16:48:37,366 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 16:48:37,366 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 16:48:37,366 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 16:48:37,367 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 16:48:37,369 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 16:48:37,372 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 16:48:37,372 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 16:48:37,375 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 16:48:37,376 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 16:48:37,378 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 16:48:37,380 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 16:48:37,380 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 16:48:37,381 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 16:48:37,381 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 16:48:37,382 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 16:48:37,383 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 16:48:37,383 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 16:48:37,388 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 16:48:37,411 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 16:48:37,412 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 16:48:37,414 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 16:48:37,414 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 16:48:37,414 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 16:48:37,415 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 16:48:37,415 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 16:48:37,415 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 16:48:37,415 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 16:48:37,415 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 16:48:37,417 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 16:48:37,417 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 16:48:37,417 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 16:48:37,417 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 16:48:37,418 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 16:48:37,418 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 16:48:37,418 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 16:48:37,418 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 16:48:37,418 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 16:48:37,419 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 16:48:37,419 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 16:48:37,419 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 16:48:37,419 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 16:48:37,420 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 16:48:37,420 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 16:48:37,420 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 16:48:37,420 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 16:48:37,420 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 16:48:37,421 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 16:48:37,421 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 16:48:37,422 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 16:48:37,683 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 16:48:37,697 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 16:48:37,700 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 16:48:37,701 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 16:48:37,702 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 16:48:37,702 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix034_pso.oepc.i [2019-12-27 16:48:37,773 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45f93c549/d9e062fb0aa44e2bb9a0fda454213974/FLAG151a1d343 [2019-12-27 16:48:38,346 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 16:48:38,347 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix034_pso.oepc.i [2019-12-27 16:48:38,366 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45f93c549/d9e062fb0aa44e2bb9a0fda454213974/FLAG151a1d343 [2019-12-27 16:48:38,595 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45f93c549/d9e062fb0aa44e2bb9a0fda454213974 [2019-12-27 16:48:38,606 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 16:48:38,609 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 16:48:38,609 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 16:48:38,610 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 16:48:38,614 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 16:48:38,615 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:48:38" (1/1) ... [2019-12-27 16:48:38,619 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63cfb440 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:48:38, skipping insertion in model container [2019-12-27 16:48:38,619 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:48:38" (1/1) ... [2019-12-27 16:48:38,628 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 16:48:38,693 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 16:48:39,224 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:48:39,243 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 16:48:39,316 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:48:39,392 INFO L208 MainTranslator]: Completed translation [2019-12-27 16:48:39,393 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:48:39 WrapperNode [2019-12-27 16:48:39,393 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 16:48:39,394 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 16:48:39,394 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 16:48:39,394 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 16:48:39,405 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:48:39" (1/1) ... [2019-12-27 16:48:39,426 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:48:39" (1/1) ... [2019-12-27 16:48:39,465 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 16:48:39,465 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 16:48:39,465 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 16:48:39,465 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 16:48:39,475 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:48:39" (1/1) ... [2019-12-27 16:48:39,475 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:48:39" (1/1) ... [2019-12-27 16:48:39,480 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:48:39" (1/1) ... [2019-12-27 16:48:39,480 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:48:39" (1/1) ... [2019-12-27 16:48:39,491 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:48:39" (1/1) ... [2019-12-27 16:48:39,495 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:48:39" (1/1) ... [2019-12-27 16:48:39,499 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:48:39" (1/1) ... [2019-12-27 16:48:39,505 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 16:48:39,505 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 16:48:39,506 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 16:48:39,506 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 16:48:39,507 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:48:39" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 16:48:39,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 16:48:39,578 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 16:48:39,578 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 16:48:39,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 16:48:39,579 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 16:48:39,579 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 16:48:39,579 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 16:48:39,579 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 16:48:39,580 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 16:48:39,580 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 16:48:39,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 16:48:39,582 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 16:48:40,326 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 16:48:40,326 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 16:48:40,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:48:40 BoogieIcfgContainer [2019-12-27 16:48:40,328 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 16:48:40,329 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 16:48:40,329 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 16:48:40,333 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 16:48:40,333 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 04:48:38" (1/3) ... [2019-12-27 16:48:40,334 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64f9f3ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:48:40, skipping insertion in model container [2019-12-27 16:48:40,334 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:48:39" (2/3) ... [2019-12-27 16:48:40,335 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64f9f3ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:48:40, skipping insertion in model container [2019-12-27 16:48:40,335 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:48:40" (3/3) ... [2019-12-27 16:48:40,337 INFO L109 eAbstractionObserver]: Analyzing ICFG mix034_pso.oepc.i [2019-12-27 16:48:40,347 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 16:48:40,348 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 16:48:40,356 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 16:48:40,357 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 16:48:40,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,399 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,400 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,400 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,400 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,401 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,405 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,405 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,405 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,405 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,406 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,406 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,406 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,406 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,407 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,407 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,407 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,407 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,408 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,408 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,410 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,410 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,413 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,413 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,419 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,419 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,423 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,423 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,423 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,423 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,428 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,428 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,442 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,442 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,453 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,453 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,453 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,453 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,454 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,454 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,454 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,454 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,455 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,455 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,455 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,455 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,455 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,456 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,456 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,456 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,456 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,457 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,457 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,457 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,457 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,475 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,476 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,476 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,476 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,476 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,477 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,477 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,477 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,477 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,477 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,478 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,478 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,478 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,478 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,478 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,479 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,482 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,482 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,482 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,482 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,483 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,483 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,483 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,483 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,483 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,484 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,484 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,484 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,486 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,487 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,487 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,487 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,487 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,488 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,488 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,488 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,488 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,488 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,488 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,489 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,489 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,489 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,489 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,489 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,490 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,490 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,490 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,490 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,490 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,490 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,490 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,491 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,491 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,491 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,491 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,491 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,492 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:40,510 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 16:48:40,533 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 16:48:40,533 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 16:48:40,533 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 16:48:40,533 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 16:48:40,533 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 16:48:40,533 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 16:48:40,533 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 16:48:40,534 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 16:48:40,557 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 149 places, 183 transitions [2019-12-27 16:48:40,559 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 149 places, 183 transitions [2019-12-27 16:48:40,648 INFO L132 PetriNetUnfolder]: 41/181 cut-off events. [2019-12-27 16:48:40,649 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:48:40,664 INFO L76 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 181 events. 41/181 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 351 event pairs. 0/138 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 16:48:40,688 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 149 places, 183 transitions [2019-12-27 16:48:40,737 INFO L132 PetriNetUnfolder]: 41/181 cut-off events. [2019-12-27 16:48:40,737 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:48:40,743 INFO L76 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 181 events. 41/181 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 351 event pairs. 0/138 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 16:48:40,757 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-27 16:48:40,759 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 16:48:45,599 WARN L192 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-27 16:48:45,708 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-27 16:48:45,935 INFO L206 etLargeBlockEncoding]: Checked pairs total: 72636 [2019-12-27 16:48:45,935 INFO L214 etLargeBlockEncoding]: Total number of compositions: 111 [2019-12-27 16:48:45,939 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 76 places, 87 transitions [2019-12-27 16:48:46,487 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8766 states. [2019-12-27 16:48:46,489 INFO L276 IsEmpty]: Start isEmpty. Operand 8766 states. [2019-12-27 16:48:46,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 16:48:46,498 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:48:46,499 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 16:48:46,500 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:48:46,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:48:46,506 INFO L82 PathProgramCache]: Analyzing trace with hash 798122, now seen corresponding path program 1 times [2019-12-27 16:48:46,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:48:46,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784390256] [2019-12-27 16:48:46,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:48:46,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:48:46,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:48:46,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784390256] [2019-12-27 16:48:46,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:48:46,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 16:48:46,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1459448998] [2019-12-27 16:48:46,741 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:48:46,747 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:48:46,764 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 16:48:46,764 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:48:46,768 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:48:46,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:48:46,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:48:46,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:48:46,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:48:46,787 INFO L87 Difference]: Start difference. First operand 8766 states. Second operand 3 states. [2019-12-27 16:48:47,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:48:47,061 INFO L93 Difference]: Finished difference Result 8598 states and 28114 transitions. [2019-12-27 16:48:47,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:48:47,063 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 16:48:47,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:48:47,209 INFO L225 Difference]: With dead ends: 8598 [2019-12-27 16:48:47,209 INFO L226 Difference]: Without dead ends: 7662 [2019-12-27 16:48:47,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:48:47,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7662 states. [2019-12-27 16:48:47,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7662 to 7662. [2019-12-27 16:48:47,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7662 states. [2019-12-27 16:48:47,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7662 states to 7662 states and 24964 transitions. [2019-12-27 16:48:47,677 INFO L78 Accepts]: Start accepts. Automaton has 7662 states and 24964 transitions. Word has length 3 [2019-12-27 16:48:47,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:48:47,677 INFO L462 AbstractCegarLoop]: Abstraction has 7662 states and 24964 transitions. [2019-12-27 16:48:47,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:48:47,678 INFO L276 IsEmpty]: Start isEmpty. Operand 7662 states and 24964 transitions. [2019-12-27 16:48:47,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 16:48:47,684 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:48:47,684 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:48:47,684 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:48:47,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:48:47,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1441761450, now seen corresponding path program 1 times [2019-12-27 16:48:47,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:48:47,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379109142] [2019-12-27 16:48:47,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:48:47,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:48:47,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:48:47,845 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379109142] [2019-12-27 16:48:47,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:48:47,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:48:47,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1488454964] [2019-12-27 16:48:47,846 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:48:47,847 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:48:47,850 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 16:48:47,850 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:48:47,850 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:48:47,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:48:47,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:48:47,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:48:47,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:48:47,853 INFO L87 Difference]: Start difference. First operand 7662 states and 24964 transitions. Second operand 3 states. [2019-12-27 16:48:47,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:48:47,891 INFO L93 Difference]: Finished difference Result 1232 states and 2811 transitions. [2019-12-27 16:48:47,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:48:47,891 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 16:48:47,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:48:47,898 INFO L225 Difference]: With dead ends: 1232 [2019-12-27 16:48:47,899 INFO L226 Difference]: Without dead ends: 1232 [2019-12-27 16:48:47,901 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-27 16:48:47,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2019-12-27 16:48:47,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 1232. [2019-12-27 16:48:47,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1232 states. [2019-12-27 16:48:47,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1232 states to 1232 states and 2811 transitions. [2019-12-27 16:48:47,941 INFO L78 Accepts]: Start accepts. Automaton has 1232 states and 2811 transitions. Word has length 11 [2019-12-27 16:48:47,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:48:47,942 INFO L462 AbstractCegarLoop]: Abstraction has 1232 states and 2811 transitions. [2019-12-27 16:48:47,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:48:47,942 INFO L276 IsEmpty]: Start isEmpty. Operand 1232 states and 2811 transitions. [2019-12-27 16:48:47,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 16:48:47,953 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:48:47,954 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:48:47,956 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:48:47,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:48:47,957 INFO L82 PathProgramCache]: Analyzing trace with hash -973399749, now seen corresponding path program 1 times [2019-12-27 16:48:47,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:48:47,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312021929] [2019-12-27 16:48:47,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:48:48,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:48:48,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:48:48,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312021929] [2019-12-27 16:48:48,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:48:48,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:48:48,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [682736416] [2019-12-27 16:48:48,062 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:48:48,063 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:48:48,066 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 16:48:48,067 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:48:48,067 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:48:48,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:48:48,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:48:48,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:48:48,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:48:48,068 INFO L87 Difference]: Start difference. First operand 1232 states and 2811 transitions. Second operand 3 states. [2019-12-27 16:48:48,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:48:48,135 INFO L93 Difference]: Finished difference Result 1943 states and 4408 transitions. [2019-12-27 16:48:48,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:48:48,136 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-27 16:48:48,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:48:48,147 INFO L225 Difference]: With dead ends: 1943 [2019-12-27 16:48:48,147 INFO L226 Difference]: Without dead ends: 1943 [2019-12-27 16:48:48,148 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-27 16:48:48,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1943 states. [2019-12-27 16:48:48,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1943 to 1365. [2019-12-27 16:48:48,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1365 states. [2019-12-27 16:48:48,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1365 states to 1365 states and 3186 transitions. [2019-12-27 16:48:48,190 INFO L78 Accepts]: Start accepts. Automaton has 1365 states and 3186 transitions. Word has length 14 [2019-12-27 16:48:48,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:48:48,191 INFO L462 AbstractCegarLoop]: Abstraction has 1365 states and 3186 transitions. [2019-12-27 16:48:48,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:48:48,191 INFO L276 IsEmpty]: Start isEmpty. Operand 1365 states and 3186 transitions. [2019-12-27 16:48:48,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 16:48:48,192 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:48:48,192 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:48:48,192 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:48:48,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:48:48,193 INFO L82 PathProgramCache]: Analyzing trace with hash -895424426, now seen corresponding path program 1 times [2019-12-27 16:48:48,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:48:48,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019499070] [2019-12-27 16:48:48,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:48:48,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:48:48,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:48:48,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019499070] [2019-12-27 16:48:48,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:48:48,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:48:48,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [639895673] [2019-12-27 16:48:48,306 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:48:48,307 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:48:48,310 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 16:48:48,310 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:48:48,310 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:48:48,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:48:48,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:48:48,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:48:48,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:48:48,311 INFO L87 Difference]: Start difference. First operand 1365 states and 3186 transitions. Second operand 4 states. [2019-12-27 16:48:48,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:48:48,526 INFO L93 Difference]: Finished difference Result 1724 states and 3916 transitions. [2019-12-27 16:48:48,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:48:48,526 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 16:48:48,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:48:48,536 INFO L225 Difference]: With dead ends: 1724 [2019-12-27 16:48:48,536 INFO L226 Difference]: Without dead ends: 1724 [2019-12-27 16:48:48,536 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:48:48,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1724 states. [2019-12-27 16:48:48,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1724 to 1660. [2019-12-27 16:48:48,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1660 states. [2019-12-27 16:48:48,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1660 states to 1660 states and 3792 transitions. [2019-12-27 16:48:48,583 INFO L78 Accepts]: Start accepts. Automaton has 1660 states and 3792 transitions. Word has length 14 [2019-12-27 16:48:48,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:48:48,584 INFO L462 AbstractCegarLoop]: Abstraction has 1660 states and 3792 transitions. [2019-12-27 16:48:48,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:48:48,584 INFO L276 IsEmpty]: Start isEmpty. Operand 1660 states and 3792 transitions. [2019-12-27 16:48:48,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 16:48:48,585 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:48:48,585 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:48:48,585 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:48:48,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:48:48,586 INFO L82 PathProgramCache]: Analyzing trace with hash -270244683, now seen corresponding path program 1 times [2019-12-27 16:48:48,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:48:48,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534520208] [2019-12-27 16:48:48,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:48:48,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:48:48,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:48:48,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534520208] [2019-12-27 16:48:48,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:48:48,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:48:48,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1014653143] [2019-12-27 16:48:48,678 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:48:48,680 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:48:48,682 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 16:48:48,682 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:48:48,683 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:48:48,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:48:48,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:48:48,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:48:48,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:48:48,684 INFO L87 Difference]: Start difference. First operand 1660 states and 3792 transitions. Second operand 4 states. [2019-12-27 16:48:48,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:48:48,873 INFO L93 Difference]: Finished difference Result 1991 states and 4482 transitions. [2019-12-27 16:48:48,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:48:48,873 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 16:48:48,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:48:48,886 INFO L225 Difference]: With dead ends: 1991 [2019-12-27 16:48:48,887 INFO L226 Difference]: Without dead ends: 1991 [2019-12-27 16:48:48,887 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:48:48,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1991 states. [2019-12-27 16:48:48,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1991 to 1731. [2019-12-27 16:48:48,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1731 states. [2019-12-27 16:48:48,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1731 states to 1731 states and 3946 transitions. [2019-12-27 16:48:48,945 INFO L78 Accepts]: Start accepts. Automaton has 1731 states and 3946 transitions. Word has length 14 [2019-12-27 16:48:48,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:48:48,946 INFO L462 AbstractCegarLoop]: Abstraction has 1731 states and 3946 transitions. [2019-12-27 16:48:48,946 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:48:48,946 INFO L276 IsEmpty]: Start isEmpty. Operand 1731 states and 3946 transitions. [2019-12-27 16:48:48,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 16:48:48,948 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:48:48,949 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:48:48,949 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:48:48,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:48:48,949 INFO L82 PathProgramCache]: Analyzing trace with hash 2057308803, now seen corresponding path program 1 times [2019-12-27 16:48:48,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:48:48,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453816361] [2019-12-27 16:48:48,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:48:48,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:48:49,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:48:49,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453816361] [2019-12-27 16:48:49,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:48:49,106 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:48:49,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1703353548] [2019-12-27 16:48:49,106 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:48:49,110 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:48:49,115 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 25 states and 24 transitions. [2019-12-27 16:48:49,115 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:48:49,115 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:48:49,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:48:49,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:48:49,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:48:49,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:48:49,116 INFO L87 Difference]: Start difference. First operand 1731 states and 3946 transitions. Second operand 5 states. [2019-12-27 16:48:49,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:48:49,394 INFO L93 Difference]: Finished difference Result 2258 states and 4996 transitions. [2019-12-27 16:48:49,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 16:48:49,396 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-12-27 16:48:49,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:48:49,419 INFO L225 Difference]: With dead ends: 2258 [2019-12-27 16:48:49,420 INFO L226 Difference]: Without dead ends: 2258 [2019-12-27 16:48:49,425 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:48:49,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2258 states. [2019-12-27 16:48:49,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2258 to 2002. [2019-12-27 16:48:49,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2002 states. [2019-12-27 16:48:49,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2002 states to 2002 states and 4502 transitions. [2019-12-27 16:48:49,542 INFO L78 Accepts]: Start accepts. Automaton has 2002 states and 4502 transitions. Word has length 24 [2019-12-27 16:48:49,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:48:49,543 INFO L462 AbstractCegarLoop]: Abstraction has 2002 states and 4502 transitions. [2019-12-27 16:48:49,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:48:49,543 INFO L276 IsEmpty]: Start isEmpty. Operand 2002 states and 4502 transitions. [2019-12-27 16:48:49,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 16:48:49,545 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:48:49,546 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:48:49,546 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:48:49,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:48:49,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1461081411, now seen corresponding path program 1 times [2019-12-27 16:48:49,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:48:49,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890120370] [2019-12-27 16:48:49,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:48:49,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:48:49,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:48:49,592 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890120370] [2019-12-27 16:48:49,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:48:49,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 16:48:49,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1268542276] [2019-12-27 16:48:49,593 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:48:49,599 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:48:49,609 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 49 states and 70 transitions. [2019-12-27 16:48:49,610 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:48:49,611 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:48:49,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:48:49,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:48:49,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:48:49,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:48:49,612 INFO L87 Difference]: Start difference. First operand 2002 states and 4502 transitions. Second operand 3 states. [2019-12-27 16:48:49,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:48:49,625 INFO L93 Difference]: Finished difference Result 2001 states and 4500 transitions. [2019-12-27 16:48:49,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:48:49,626 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-27 16:48:49,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:48:49,641 INFO L225 Difference]: With dead ends: 2001 [2019-12-27 16:48:49,641 INFO L226 Difference]: Without dead ends: 2001 [2019-12-27 16:48:49,644 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:48:49,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2001 states. [2019-12-27 16:48:49,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2001 to 2001. [2019-12-27 16:48:49,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2001 states. [2019-12-27 16:48:49,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2001 states to 2001 states and 4500 transitions. [2019-12-27 16:48:49,689 INFO L78 Accepts]: Start accepts. Automaton has 2001 states and 4500 transitions. Word has length 26 [2019-12-27 16:48:49,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:48:49,690 INFO L462 AbstractCegarLoop]: Abstraction has 2001 states and 4500 transitions. [2019-12-27 16:48:49,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:48:49,690 INFO L276 IsEmpty]: Start isEmpty. Operand 2001 states and 4500 transitions. [2019-12-27 16:48:49,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 16:48:49,692 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:48:49,692 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:48:49,693 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:48:49,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:48:49,693 INFO L82 PathProgramCache]: Analyzing trace with hash 605769272, now seen corresponding path program 1 times [2019-12-27 16:48:49,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:48:49,694 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055603973] [2019-12-27 16:48:49,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:48:49,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:48:49,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:48:49,783 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055603973] [2019-12-27 16:48:49,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:48:49,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 16:48:49,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1290276758] [2019-12-27 16:48:49,784 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:48:49,791 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:48:49,798 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 27 states and 26 transitions. [2019-12-27 16:48:49,798 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:48:49,798 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:48:49,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:48:49,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:48:49,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:48:49,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:48:49,800 INFO L87 Difference]: Start difference. First operand 2001 states and 4500 transitions. Second operand 5 states. [2019-12-27 16:48:49,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:48:49,877 INFO L93 Difference]: Finished difference Result 2103 states and 4690 transitions. [2019-12-27 16:48:49,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:48:49,878 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-27 16:48:49,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:48:49,883 INFO L225 Difference]: With dead ends: 2103 [2019-12-27 16:48:49,883 INFO L226 Difference]: Without dead ends: 2103 [2019-12-27 16:48:49,884 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:48:49,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2103 states. [2019-12-27 16:48:49,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2103 to 2103. [2019-12-27 16:48:49,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2103 states. [2019-12-27 16:48:49,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2103 states to 2103 states and 4690 transitions. [2019-12-27 16:48:49,927 INFO L78 Accepts]: Start accepts. Automaton has 2103 states and 4690 transitions. Word has length 26 [2019-12-27 16:48:49,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:48:49,928 INFO L462 AbstractCegarLoop]: Abstraction has 2103 states and 4690 transitions. [2019-12-27 16:48:49,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:48:49,928 INFO L276 IsEmpty]: Start isEmpty. Operand 2103 states and 4690 transitions. [2019-12-27 16:48:49,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 16:48:49,931 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:48:49,931 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:48:49,931 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:48:49,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:48:49,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1750039425, now seen corresponding path program 1 times [2019-12-27 16:48:49,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:48:49,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332747810] [2019-12-27 16:48:49,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:48:49,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:48:50,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:48:50,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332747810] [2019-12-27 16:48:50,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:48:50,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 16:48:50,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1824774593] [2019-12-27 16:48:50,008 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:48:50,013 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:48:50,026 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 59 states and 89 transitions. [2019-12-27 16:48:50,027 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:48:50,130 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 16:48:50,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 16:48:50,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:48:50,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 16:48:50,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 16:48:50,131 INFO L87 Difference]: Start difference. First operand 2103 states and 4690 transitions. Second operand 8 states. [2019-12-27 16:48:50,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:48:50,824 INFO L93 Difference]: Finished difference Result 2987 states and 6548 transitions. [2019-12-27 16:48:50,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 16:48:50,824 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2019-12-27 16:48:50,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:48:50,832 INFO L225 Difference]: With dead ends: 2987 [2019-12-27 16:48:50,832 INFO L226 Difference]: Without dead ends: 2987 [2019-12-27 16:48:50,833 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:48:50,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2987 states. [2019-12-27 16:48:50,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2987 to 2570. [2019-12-27 16:48:50,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2570 states. [2019-12-27 16:48:50,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2570 states to 2570 states and 5722 transitions. [2019-12-27 16:48:50,936 INFO L78 Accepts]: Start accepts. Automaton has 2570 states and 5722 transitions. Word has length 27 [2019-12-27 16:48:50,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:48:50,936 INFO L462 AbstractCegarLoop]: Abstraction has 2570 states and 5722 transitions. [2019-12-27 16:48:50,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 16:48:50,937 INFO L276 IsEmpty]: Start isEmpty. Operand 2570 states and 5722 transitions. [2019-12-27 16:48:50,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 16:48:50,940 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:48:50,941 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:48:50,941 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:48:50,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:48:50,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1454990422, now seen corresponding path program 1 times [2019-12-27 16:48:50,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:48:50,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453112948] [2019-12-27 16:48:50,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:48:50,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:48:51,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:48:51,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453112948] [2019-12-27 16:48:51,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:48:51,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:48:51,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [827060056] [2019-12-27 16:48:51,031 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:48:51,036 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:48:51,042 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 16:48:51,043 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:48:51,043 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:48:51,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:48:51,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:48:51,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:48:51,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:48:51,044 INFO L87 Difference]: Start difference. First operand 2570 states and 5722 transitions. Second operand 5 states. [2019-12-27 16:48:51,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:48:51,286 INFO L93 Difference]: Finished difference Result 3072 states and 6694 transitions. [2019-12-27 16:48:51,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 16:48:51,286 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-27 16:48:51,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:48:51,295 INFO L225 Difference]: With dead ends: 3072 [2019-12-27 16:48:51,295 INFO L226 Difference]: Without dead ends: 3072 [2019-12-27 16:48:51,295 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:48:51,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3072 states. [2019-12-27 16:48:51,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3072 to 2505. [2019-12-27 16:48:51,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2505 states. [2019-12-27 16:48:51,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2505 states to 2505 states and 5590 transitions. [2019-12-27 16:48:51,351 INFO L78 Accepts]: Start accepts. Automaton has 2505 states and 5590 transitions. Word has length 27 [2019-12-27 16:48:51,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:48:51,352 INFO L462 AbstractCegarLoop]: Abstraction has 2505 states and 5590 transitions. [2019-12-27 16:48:51,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:48:51,352 INFO L276 IsEmpty]: Start isEmpty. Operand 2505 states and 5590 transitions. [2019-12-27 16:48:51,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 16:48:51,356 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:48:51,356 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:48:51,356 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:48:51,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:48:51,357 INFO L82 PathProgramCache]: Analyzing trace with hash 93559855, now seen corresponding path program 1 times [2019-12-27 16:48:51,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:48:51,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497974923] [2019-12-27 16:48:51,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:48:51,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:48:51,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:48:51,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497974923] [2019-12-27 16:48:51,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:48:51,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:48:51,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1942935946] [2019-12-27 16:48:51,400 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:48:51,405 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:48:51,418 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 61 states and 92 transitions. [2019-12-27 16:48:51,418 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:48:51,436 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 16:48:51,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:48:51,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:48:51,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:48:51,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:48:51,437 INFO L87 Difference]: Start difference. First operand 2505 states and 5590 transitions. Second operand 5 states. [2019-12-27 16:48:51,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:48:51,460 INFO L93 Difference]: Finished difference Result 1400 states and 2990 transitions. [2019-12-27 16:48:51,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 16:48:51,460 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 16:48:51,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:48:51,463 INFO L225 Difference]: With dead ends: 1400 [2019-12-27 16:48:51,463 INFO L226 Difference]: Without dead ends: 1400 [2019-12-27 16:48:51,464 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-27 16:48:51,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states. [2019-12-27 16:48:51,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 1305. [2019-12-27 16:48:51,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1305 states. [2019-12-27 16:48:51,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1305 states to 1305 states and 2815 transitions. [2019-12-27 16:48:51,488 INFO L78 Accepts]: Start accepts. Automaton has 1305 states and 2815 transitions. Word has length 28 [2019-12-27 16:48:51,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:48:51,488 INFO L462 AbstractCegarLoop]: Abstraction has 1305 states and 2815 transitions. [2019-12-27 16:48:51,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:48:51,488 INFO L276 IsEmpty]: Start isEmpty. Operand 1305 states and 2815 transitions. [2019-12-27 16:48:51,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-27 16:48:51,492 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:48:51,492 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:48:51,492 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:48:51,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:48:51,492 INFO L82 PathProgramCache]: Analyzing trace with hash -466202404, now seen corresponding path program 1 times [2019-12-27 16:48:51,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:48:51,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028193433] [2019-12-27 16:48:51,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:48:51,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:48:51,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:48:51,616 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028193433] [2019-12-27 16:48:51,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:48:51,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:48:51,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1034803971] [2019-12-27 16:48:51,617 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:48:51,631 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:48:51,679 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 91 states and 130 transitions. [2019-12-27 16:48:51,679 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:48:51,761 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 16:48:51,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 16:48:51,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:48:51,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 16:48:51,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 16:48:51,762 INFO L87 Difference]: Start difference. First operand 1305 states and 2815 transitions. Second operand 10 states. [2019-12-27 16:48:52,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:48:52,272 INFO L93 Difference]: Finished difference Result 3479 states and 7322 transitions. [2019-12-27 16:48:52,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 16:48:52,273 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50 [2019-12-27 16:48:52,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:48:52,280 INFO L225 Difference]: With dead ends: 3479 [2019-12-27 16:48:52,280 INFO L226 Difference]: Without dead ends: 2269 [2019-12-27 16:48:52,281 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2019-12-27 16:48:52,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2269 states. [2019-12-27 16:48:52,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2269 to 1348. [2019-12-27 16:48:52,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1348 states. [2019-12-27 16:48:52,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 1348 states and 2908 transitions. [2019-12-27 16:48:52,335 INFO L78 Accepts]: Start accepts. Automaton has 1348 states and 2908 transitions. Word has length 50 [2019-12-27 16:48:52,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:48:52,335 INFO L462 AbstractCegarLoop]: Abstraction has 1348 states and 2908 transitions. [2019-12-27 16:48:52,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 16:48:52,336 INFO L276 IsEmpty]: Start isEmpty. Operand 1348 states and 2908 transitions. [2019-12-27 16:48:52,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-27 16:48:52,339 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:48:52,339 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:48:52,340 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:48:52,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:48:52,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1410793752, now seen corresponding path program 2 times [2019-12-27 16:48:52,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:48:52,341 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963419866] [2019-12-27 16:48:52,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:48:52,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:48:52,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:48:52,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963419866] [2019-12-27 16:48:52,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:48:52,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:48:52,438 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1134002697] [2019-12-27 16:48:52,439 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:48:52,452 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:48:52,520 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 106 states and 150 transitions. [2019-12-27 16:48:52,520 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:48:52,527 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 16:48:52,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:48:52,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:48:52,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:48:52,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:48:52,528 INFO L87 Difference]: Start difference. First operand 1348 states and 2908 transitions. Second operand 3 states. [2019-12-27 16:48:52,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:48:52,583 INFO L93 Difference]: Finished difference Result 1629 states and 3459 transitions. [2019-12-27 16:48:52,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:48:52,583 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-12-27 16:48:52,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:48:52,587 INFO L225 Difference]: With dead ends: 1629 [2019-12-27 16:48:52,587 INFO L226 Difference]: Without dead ends: 1629 [2019-12-27 16:48:52,589 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:48:52,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1629 states. [2019-12-27 16:48:52,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1629 to 1368. [2019-12-27 16:48:52,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1368 states. [2019-12-27 16:48:52,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1368 states to 1368 states and 2946 transitions. [2019-12-27 16:48:52,619 INFO L78 Accepts]: Start accepts. Automaton has 1368 states and 2946 transitions. Word has length 50 [2019-12-27 16:48:52,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:48:52,620 INFO L462 AbstractCegarLoop]: Abstraction has 1368 states and 2946 transitions. [2019-12-27 16:48:52,620 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:48:52,620 INFO L276 IsEmpty]: Start isEmpty. Operand 1368 states and 2946 transitions. [2019-12-27 16:48:52,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 16:48:52,624 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:48:52,625 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:48:52,625 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:48:52,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:48:52,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1876939711, now seen corresponding path program 1 times [2019-12-27 16:48:52,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:48:52,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091857345] [2019-12-27 16:48:52,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:48:52,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:48:52,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:48:52,819 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091857345] [2019-12-27 16:48:52,819 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:48:52,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 16:48:52,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [126519739] [2019-12-27 16:48:52,820 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:48:52,840 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:48:52,896 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 80 states and 99 transitions. [2019-12-27 16:48:52,896 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:48:53,004 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 16:48:53,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 16:48:53,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:48:53,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 16:48:53,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-27 16:48:53,070 INFO L87 Difference]: Start difference. First operand 1368 states and 2946 transitions. Second operand 11 states. [2019-12-27 16:48:54,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:48:54,134 INFO L93 Difference]: Finished difference Result 1807 states and 3732 transitions. [2019-12-27 16:48:54,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 16:48:54,135 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 51 [2019-12-27 16:48:54,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:48:54,139 INFO L225 Difference]: With dead ends: 1807 [2019-12-27 16:48:54,139 INFO L226 Difference]: Without dead ends: 1807 [2019-12-27 16:48:54,139 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 6 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2019-12-27 16:48:54,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1807 states. [2019-12-27 16:48:54,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1807 to 1312. [2019-12-27 16:48:54,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1312 states. [2019-12-27 16:48:54,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1312 states to 1312 states and 2755 transitions. [2019-12-27 16:48:54,165 INFO L78 Accepts]: Start accepts. Automaton has 1312 states and 2755 transitions. Word has length 51 [2019-12-27 16:48:54,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:48:54,165 INFO L462 AbstractCegarLoop]: Abstraction has 1312 states and 2755 transitions. [2019-12-27 16:48:54,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 16:48:54,165 INFO L276 IsEmpty]: Start isEmpty. Operand 1312 states and 2755 transitions. [2019-12-27 16:48:54,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 16:48:54,168 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:48:54,169 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:48:54,169 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:48:54,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:48:54,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1053790121, now seen corresponding path program 2 times [2019-12-27 16:48:54,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:48:54,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199996364] [2019-12-27 16:48:54,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:48:54,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:48:54,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:48:54,227 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199996364] [2019-12-27 16:48:54,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:48:54,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:48:54,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1227689114] [2019-12-27 16:48:54,228 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:48:54,241 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:48:54,293 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 87 states and 113 transitions. [2019-12-27 16:48:54,294 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:48:54,294 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:48:54,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:48:54,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:48:54,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:48:54,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:48:54,296 INFO L87 Difference]: Start difference. First operand 1312 states and 2755 transitions. Second operand 3 states. [2019-12-27 16:48:54,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:48:54,317 INFO L93 Difference]: Finished difference Result 1311 states and 2753 transitions. [2019-12-27 16:48:54,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:48:54,318 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-27 16:48:54,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:48:54,321 INFO L225 Difference]: With dead ends: 1311 [2019-12-27 16:48:54,322 INFO L226 Difference]: Without dead ends: 1311 [2019-12-27 16:48:54,322 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:48:54,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1311 states. [2019-12-27 16:48:54,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1311 to 995. [2019-12-27 16:48:54,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 995 states. [2019-12-27 16:48:54,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 2128 transitions. [2019-12-27 16:48:54,345 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 2128 transitions. Word has length 51 [2019-12-27 16:48:54,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:48:54,346 INFO L462 AbstractCegarLoop]: Abstraction has 995 states and 2128 transitions. [2019-12-27 16:48:54,346 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:48:54,346 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 2128 transitions. [2019-12-27 16:48:54,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 16:48:54,349 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:48:54,349 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:48:54,349 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:48:54,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:48:54,350 INFO L82 PathProgramCache]: Analyzing trace with hash 860763375, now seen corresponding path program 1 times [2019-12-27 16:48:54,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:48:54,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64108910] [2019-12-27 16:48:54,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:48:54,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 16:48:54,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 16:48:54,470 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 16:48:54,470 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 16:48:54,474 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] ULTIMATE.startENTRY-->L804: Formula: (let ((.cse0 (store |v_#valid_57| 0 0))) (and (= 0 v_~__unbuffered_p0_EAX~0_86) (= v_~z$w_buff1_used~0_473 0) (= v_~z$r_buff0_thd0~0_147 0) (= 0 v_~z$flush_delayed~0_37) (= v_~y~0_17 0) (= v_~z$w_buff0~0_405 0) (= v_~z$r_buff1_thd2~0_225 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t901~0.base_35|) 0) (= v_~z$w_buff1~0_248 0) (= v_~z~0_137 0) (= v_~main$tmp_guard0~0_15 0) (= v_~z$r_buff1_thd1~0_122 0) (= v_~__unbuffered_p1_EBX~0_35 0) (= 0 v_~__unbuffered_cnt~0_56) (= v_~weak$$choice2~0_106 0) (= 0 v_~__unbuffered_p1_EAX~0_37) (= |v_ULTIMATE.start_main_~#t901~0.offset_24| 0) (= v_~z$r_buff1_thd0~0_141 0) (= v_~z$read_delayed_var~0.offset_7 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t901~0.base_35| 1) |v_#valid_55|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t901~0.base_35|) (= v_~z$r_buff0_thd2~0_374 0) (= 0 v_~weak$$choice0~0_18) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t901~0.base_35| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t901~0.base_35|) |v_ULTIMATE.start_main_~#t901~0.offset_24| 0)) |v_#memory_int_15|) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= v_~z$w_buff0_used~0_734 0) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_36 0) (= v_~x~0_79 0) (= v_~z$r_buff0_thd1~0_206 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t901~0.base_35| 4)) (= 0 |v_#NULL.base_5|) (= v_~z$mem_tmp~0_21 0) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t902~0.offset=|v_ULTIMATE.start_main_~#t902~0.offset_15|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_225, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_248, #NULL.offset=|v_#NULL.offset_5|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_271|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_129|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_75|, ULTIMATE.start_main_~#t901~0.base=|v_ULTIMATE.start_main_~#t901~0.base_35|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_39|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_147, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_86, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_37, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_141, #length=|v_#length_15|, ~y~0=v_~y~0_17, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_374, ~z$mem_tmp~0=v_~z$mem_tmp~0_21, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_35, ULTIMATE.start_main_~#t902~0.base=|v_ULTIMATE.start_main_~#t902~0.base_17|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_734, ~z$w_buff0~0=v_~z$w_buff0~0_405, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_473, ~z$flush_delayed~0=v_~z$flush_delayed~0_37, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_15, #NULL.base=|v_#NULL.base_5|, ~weak$$choice0~0=v_~weak$$choice0~0_18, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_53|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_77|, ULTIMATE.start_main_~#t901~0.offset=|v_ULTIMATE.start_main_~#t901~0.offset_24|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_22|, #valid=|v_#valid_55|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_122, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_17|, ~z~0=v_~z~0_137, ~weak$$choice2~0=v_~weak$$choice2~0_106, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_206, ~x~0=v_~x~0_79} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t902~0.offset, ~z$r_buff1_thd2~0, ~z$read_delayed~0, ~z$w_buff1~0, #NULL.offset, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_~#t901~0.base, ULTIMATE.start_main_#t~ite44, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~z$r_buff1_thd0~0, #length, ~y~0, ~z$r_buff0_thd2~0, ~z$mem_tmp~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_~#t902~0.base, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~main$tmp_guard0~0, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t901~0.offset, ULTIMATE.start_main_#res, #valid, ~z$r_buff1_thd1~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~z$read_delayed_var~0.base, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-27 16:48:54,475 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L804-1-->L806: Formula: (and (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t902~0.base_13| 4)) (= (store |v_#valid_30| |v_ULTIMATE.start_main_~#t902~0.base_13| 1) |v_#valid_29|) (= 0 (select |v_#valid_30| |v_ULTIMATE.start_main_~#t902~0.base_13|)) (= 0 |v_ULTIMATE.start_main_~#t902~0.offset_11|) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t902~0.base_13| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t902~0.base_13|) |v_ULTIMATE.start_main_~#t902~0.offset_11| 1)) |v_#memory_int_9|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t902~0.base_13|) (not (= 0 |v_ULTIMATE.start_main_~#t902~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t902~0.offset=|v_ULTIMATE.start_main_~#t902~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t902~0.base=|v_ULTIMATE.start_main_~#t902~0.base_13|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t902~0.offset, ULTIMATE.start_main_~#t902~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-27 16:48:54,475 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] P0ENTRY-->L4-3: Formula: (and (= ~z$w_buff1_used~0_Out1608786120 ~z$w_buff0_used~0_In1608786120) (= ~z$w_buff0~0_Out1608786120 1) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out1608786120| P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out1608786120) (= ~z$w_buff0_used~0_Out1608786120 1) (= |P0Thread1of1ForFork0_#in~arg.offset_In1608786120| P0Thread1of1ForFork0_~arg.offset_Out1608786120) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out1608786120| 1) (= 0 (mod ~z$w_buff1_used~0_Out1608786120 256)) (= P0Thread1of1ForFork0_~arg.base_Out1608786120 |P0Thread1of1ForFork0_#in~arg.base_In1608786120|) (= ~z$w_buff1~0_Out1608786120 ~z$w_buff0~0_In1608786120)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In1608786120|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1608786120, ~z$w_buff0~0=~z$w_buff0~0_In1608786120, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In1608786120|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In1608786120|, ~z$w_buff0_used~0=~z$w_buff0_used~0_Out1608786120, ~z$w_buff0~0=~z$w_buff0~0_Out1608786120, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out1608786120, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out1608786120, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In1608786120|, ~z$w_buff1~0=~z$w_buff1~0_Out1608786120, P0Thread1of1ForFork0_~arg.base=P0Thread1of1ForFork0_~arg.base_Out1608786120, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out1608786120|, P0Thread1of1ForFork0_~arg.offset=P0Thread1of1ForFork0_~arg.offset_Out1608786120} 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-27 16:48:54,484 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L773-->L773-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-656970637 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite24_Out-656970637| ~z$w_buff1_used~0_In-656970637) (= |P1Thread1of1ForFork1_#t~ite23_In-656970637| |P1Thread1of1ForFork1_#t~ite23_Out-656970637|)) (and (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-656970637 256)))) (or (and .cse1 (= (mod ~z$r_buff1_thd2~0_In-656970637 256) 0)) (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In-656970637 256))) (= 0 (mod ~z$w_buff0_used~0_In-656970637 256)))) (= |P1Thread1of1ForFork1_#t~ite23_Out-656970637| ~z$w_buff1_used~0_In-656970637) (= |P1Thread1of1ForFork1_#t~ite23_Out-656970637| |P1Thread1of1ForFork1_#t~ite24_Out-656970637|) .cse0))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-656970637, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-656970637, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-656970637, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In-656970637|, ~weak$$choice2~0=~weak$$choice2~0_In-656970637, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-656970637} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-656970637, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-656970637, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out-656970637|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-656970637, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out-656970637|, ~weak$$choice2~0=~weak$$choice2~0_In-656970637, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-656970637} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24] because there is no mapped edge [2019-12-27 16:48:54,485 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L774-->L775-8: Formula: (and (= |v_P1Thread1of1ForFork1_#t~ite29_47| |v_P1Thread1of1ForFork1_#t~ite29_46|) (= |v_P1Thread1of1ForFork1_#t~ite28_51| |v_P1Thread1of1ForFork1_#t~ite28_50|) (= v_~z$r_buff0_thd2~0_355 v_~z$r_buff0_thd2~0_354) (= v_~z$r_buff1_thd2~0_205 |v_P1Thread1of1ForFork1_#t~ite30_40|) (not (= 0 (mod v_~weak$$choice2~0_96 256)))) InVars {P1Thread1of1ForFork1_#t~ite29=|v_P1Thread1of1ForFork1_#t~ite29_47|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_205, ~weak$$choice2~0=v_~weak$$choice2~0_96, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_355, P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_51|} OutVars{P1Thread1of1ForFork1_#t~ite29=|v_P1Thread1of1ForFork1_#t~ite29_46|, P1Thread1of1ForFork1_#t~ite30=|v_P1Thread1of1ForFork1_#t~ite30_40|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_205, ~weak$$choice2~0=v_~weak$$choice2~0_96, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_26|, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_354, P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_50|, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_29|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_31|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30, P1Thread1of1ForFork1_#t~ite27, ~z$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite28, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-27 16:48:54,486 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [664] [664] L777-->L781: Formula: (and (not (= (mod v_~z$flush_delayed~0_8 256) 0)) (= 0 v_~z$flush_delayed~0_7) (= v_~z~0_31 v_~z$mem_tmp~0_5)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_8} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_31} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 16:48:54,487 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L743-->L743-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In318952653 256))) (.cse0 (= (mod ~z$r_buff0_thd1~0_In318952653 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out318952653|) (not .cse0) (not .cse1)) (and (= ~z$w_buff0_used~0_In318952653 |P0Thread1of1ForFork0_#t~ite5_Out318952653|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In318952653, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In318952653} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out318952653|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In318952653, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In318952653} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 16:48:54,488 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L744-->L744-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd1~0_In594428172 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In594428172 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In594428172 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In594428172 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out594428172| ~z$w_buff1_used~0_In594428172) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P0Thread1of1ForFork0_#t~ite6_Out594428172| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In594428172, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In594428172, ~z$w_buff1_used~0=~z$w_buff1_used~0_In594428172, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In594428172} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out594428172|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In594428172, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In594428172, ~z$w_buff1_used~0=~z$w_buff1_used~0_In594428172, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In594428172} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 16:48:54,489 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L745-->L746: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd1~0_In-1102543897 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-1102543897 256) 0))) (or (and (= 0 ~z$r_buff0_thd1~0_Out-1102543897) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd1~0_In-1102543897 ~z$r_buff0_thd1~0_Out-1102543897)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1102543897, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1102543897} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1102543897, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1102543897|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-1102543897} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 16:48:54,489 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L746-->L746-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1347336835 256))) (.cse0 (= (mod ~z$r_buff0_thd1~0_In1347336835 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In1347336835 256))) (.cse2 (= (mod ~z$r_buff1_thd1~0_In1347336835 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out1347336835| 0)) (and (or .cse1 .cse0) (= ~z$r_buff1_thd1~0_In1347336835 |P0Thread1of1ForFork0_#t~ite8_Out1347336835|) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1347336835, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1347336835, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1347336835, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1347336835} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1347336835, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1347336835|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1347336835, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1347336835, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1347336835} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 16:48:54,490 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L781-2-->L781-5: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd2~0_In946809399 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In946809399 256))) (.cse0 (= |P1Thread1of1ForFork1_#t~ite33_Out946809399| |P1Thread1of1ForFork1_#t~ite32_Out946809399|))) (or (and .cse0 (or .cse1 .cse2) (= ~z~0_In946809399 |P1Thread1of1ForFork1_#t~ite32_Out946809399|)) (and (not .cse2) (not .cse1) (= ~z$w_buff1~0_In946809399 |P1Thread1of1ForFork1_#t~ite32_Out946809399|) .cse0))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In946809399, ~z$w_buff1_used~0=~z$w_buff1_used~0_In946809399, ~z$w_buff1~0=~z$w_buff1~0_In946809399, ~z~0=~z~0_In946809399} OutVars{~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In946809399, ~z$w_buff1_used~0=~z$w_buff1_used~0_In946809399, ~z$w_buff1~0=~z$w_buff1~0_In946809399, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out946809399|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out946809399|, ~z~0=~z~0_In946809399} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-27 16:48:54,490 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L782-->L782-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1125457640 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In1125457640 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite34_Out1125457640|) (not .cse0) (not .cse1)) (and (= ~z$w_buff0_used~0_In1125457640 |P1Thread1of1ForFork1_#t~ite34_Out1125457640|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1125457640, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1125457640} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1125457640, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out1125457640|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1125457640} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 16:48:54,491 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L783-->L783-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd2~0_In1419714995 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1419714995 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In1419714995 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In1419714995 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite35_Out1419714995| 0)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite35_Out1419714995| ~z$w_buff1_used~0_In1419714995)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1419714995, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1419714995, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1419714995, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1419714995} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1419714995, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1419714995, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1419714995, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out1419714995|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1419714995} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 16:48:54,492 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L784-->L784-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1315309262 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In1315309262 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite36_Out1315309262| 0) (not .cse1)) (and (= ~z$r_buff0_thd2~0_In1315309262 |P1Thread1of1ForFork1_#t~ite36_Out1315309262|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1315309262, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1315309262} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1315309262, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1315309262, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out1315309262|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 16:48:54,493 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L785-->L785-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-421085114 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In-421085114 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd2~0_In-421085114 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In-421085114 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite37_Out-421085114| 0)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite37_Out-421085114| ~z$r_buff1_thd2~0_In-421085114) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-421085114, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-421085114, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-421085114, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-421085114} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-421085114, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-421085114, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-421085114, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-421085114, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-421085114|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 16:48:54,493 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L785-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~z$r_buff1_thd2~0_128 |v_P1Thread1of1ForFork1_#t~ite37_30|) (= (+ v_~__unbuffered_cnt~0_41 1) v_~__unbuffered_cnt~0_40) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_30|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_128, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_29|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 16:48:54,493 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L746-2-->P0EXIT: Formula: (and (= v_~z$r_buff1_thd1~0_51 |v_P0Thread1of1ForFork0_#t~ite8_28|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~__unbuffered_cnt~0_33 (+ v_~__unbuffered_cnt~0_34 1)) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_27|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_51, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} 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-27 16:48:54,493 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L806-1-->L812: Formula: (and (= 2 v_~__unbuffered_cnt~0_22) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_6|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-27 16:48:54,494 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L812-2-->L812-4: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In618948786 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd0~0_In618948786 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out618948786| ~z~0_In618948786) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite40_Out618948786| ~z$w_buff1~0_In618948786) (not .cse1) (not .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In618948786, ~z$w_buff1_used~0=~z$w_buff1_used~0_In618948786, ~z$w_buff1~0=~z$w_buff1~0_In618948786, ~z~0=~z~0_In618948786} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out618948786|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In618948786, ~z$w_buff1_used~0=~z$w_buff1_used~0_In618948786, ~z$w_buff1~0=~z$w_buff1~0_In618948786, ~z~0=~z~0_In618948786} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 16:48:54,495 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L812-4-->L813: Formula: (= v_~z~0_17 |v_ULTIMATE.start_main_#t~ite40_11|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_11|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ~z~0=v_~z~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~z~0] because there is no mapped edge [2019-12-27 16:48:54,495 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L813-->L813-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In900668678 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In900668678 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite42_Out900668678|) (not .cse0) (not .cse1)) (and (= ~z$w_buff0_used~0_In900668678 |ULTIMATE.start_main_#t~ite42_Out900668678|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In900668678, ~z$w_buff0_used~0=~z$w_buff0_used~0_In900668678} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In900668678, ~z$w_buff0_used~0=~z$w_buff0_used~0_In900668678, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out900668678|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 16:48:54,496 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L814-->L814-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In-691984481 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-691984481 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-691984481 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-691984481 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite43_Out-691984481|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~z$w_buff1_used~0_In-691984481 |ULTIMATE.start_main_#t~ite43_Out-691984481|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-691984481, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-691984481, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-691984481, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-691984481} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-691984481, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-691984481, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-691984481, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-691984481, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-691984481|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 16:48:54,497 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L815-->L815-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In647343062 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In647343062 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In647343062 |ULTIMATE.start_main_#t~ite44_Out647343062|)) (and (= 0 |ULTIMATE.start_main_#t~ite44_Out647343062|) (not .cse0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In647343062, ~z$w_buff0_used~0=~z$w_buff0_used~0_In647343062} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In647343062, ~z$w_buff0_used~0=~z$w_buff0_used~0_In647343062, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out647343062|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 16:48:54,498 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L816-->L816-2: Formula: (let ((.cse2 (= (mod ~z$r_buff0_thd0~0_In1251444521 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In1251444521 256))) (.cse0 (= (mod ~z$r_buff1_thd0~0_In1251444521 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In1251444521 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out1251444521| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite45_Out1251444521| ~z$r_buff1_thd0~0_In1251444521) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1251444521, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1251444521, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1251444521, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1251444521} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1251444521, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1251444521, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1251444521, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1251444521, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1251444521|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 16:48:54,498 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L816-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_15 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= 0 v_~__unbuffered_p0_EAX~0_52) (= v_~__unbuffered_p1_EBX~0_20 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_15 256)) (= 1 v_~__unbuffered_p1_EAX~0_22) (= |v_ULTIMATE.start_main_#t~ite45_42| v_~z$r_buff1_thd0~0_93)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_52, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_42|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_52, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_93, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_41|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 16:48:54,574 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 04:48:54 BasicIcfg [2019-12-27 16:48:54,574 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 16:48:54,576 INFO L168 Benchmark]: Toolchain (without parser) took 15967.79 ms. Allocated memory was 138.9 MB in the beginning and 512.2 MB in the end (delta: 373.3 MB). Free memory was 102.3 MB in the beginning and 158.9 MB in the end (delta: -56.6 MB). Peak memory consumption was 316.7 MB. Max. memory is 7.1 GB. [2019-12-27 16:48:54,576 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 138.9 MB. Free memory is still 121.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 16:48:54,577 INFO L168 Benchmark]: CACSL2BoogieTranslator took 783.80 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 101.8 MB in the beginning and 157.3 MB in the end (delta: -55.5 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB. [2019-12-27 16:48:54,578 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.07 ms. Allocated memory is still 203.4 MB. Free memory was 157.3 MB in the beginning and 154.4 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-27 16:48:54,578 INFO L168 Benchmark]: Boogie Preprocessor took 39.92 ms. Allocated memory is still 203.4 MB. Free memory was 154.4 MB in the beginning and 152.5 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-27 16:48:54,579 INFO L168 Benchmark]: RCFGBuilder took 822.69 ms. Allocated memory is still 203.4 MB. Free memory was 152.5 MB in the beginning and 107.2 MB in the end (delta: 45.3 MB). Peak memory consumption was 45.3 MB. Max. memory is 7.1 GB. [2019-12-27 16:48:54,580 INFO L168 Benchmark]: TraceAbstraction took 14244.90 ms. Allocated memory was 203.4 MB in the beginning and 512.2 MB in the end (delta: 308.8 MB). Free memory was 107.2 MB in the beginning and 158.9 MB in the end (delta: -51.7 MB). Peak memory consumption was 257.1 MB. Max. memory is 7.1 GB. [2019-12-27 16:48:54,584 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 138.9 MB. Free memory is still 121.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 783.80 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 101.8 MB in the beginning and 157.3 MB in the end (delta: -55.5 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 71.07 ms. Allocated memory is still 203.4 MB. Free memory was 157.3 MB in the beginning and 154.4 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.92 ms. Allocated memory is still 203.4 MB. Free memory was 154.4 MB in the beginning and 152.5 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 822.69 ms. Allocated memory is still 203.4 MB. Free memory was 152.5 MB in the beginning and 107.2 MB in the end (delta: 45.3 MB). Peak memory consumption was 45.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14244.90 ms. Allocated memory was 203.4 MB in the beginning and 512.2 MB in the end (delta: 308.8 MB). Free memory was 107.2 MB in the beginning and 158.9 MB in the end (delta: -51.7 MB). Peak memory consumption was 257.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.3s, 149 ProgramPointsBefore, 76 ProgramPointsAfterwards, 183 TransitionsBefore, 87 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 11 FixpointIterations, 31 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 26 ChoiceCompositions, 4657 VarBasedMoverChecksPositive, 296 VarBasedMoverChecksNegative, 137 SemBasedMoverChecksPositive, 234 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 0 MoverChecksTotal, 72636 CheckedPairsTotal, 111 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L804] FCALL, FORK 0 pthread_create(&t901, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L806] FCALL, FORK 0 pthread_create(&t902, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L733] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L734] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L735] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L736] 1 z$r_buff0_thd1 = (_Bool)1 [L739] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 2 x = 1 [L759] 2 y = 1 [L762] 2 __unbuffered_p1_EAX = y [L765] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L766] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L767] 2 z$flush_delayed = weak$$choice2 [L768] 2 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L770] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L771] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L772] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L773] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L775] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] 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) [L743] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L744] 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 [L781] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, 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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L781] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L782] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L783] 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 [L784] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L812] 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}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, 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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L813] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L814] 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 [L815] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 143 locations, 2 error locations. Result: UNSAFE, OverallTime: 13.9s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1894 SDtfs, 1758 SDslu, 4606 SDs, 0 SdLazy, 2587 SolverSat, 83 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 116 GetRequests, 34 SyntacticMatches, 19 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8766occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 4230 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 468 NumberOfCodeBlocks, 468 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 401 ConstructedInterpolants, 0 QuantifiedInterpolants, 54111 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...