/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix054_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 13:55:55,518 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 13:55:55,521 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 13:55:55,532 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 13:55:55,532 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 13:55:55,533 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 13:55:55,535 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 13:55:55,536 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 13:55:55,538 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 13:55:55,539 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 13:55:55,540 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 13:55:55,541 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 13:55:55,541 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 13:55:55,542 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 13:55:55,543 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 13:55:55,544 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 13:55:55,545 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 13:55:55,546 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 13:55:55,548 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 13:55:55,550 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 13:55:55,552 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 13:55:55,553 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 13:55:55,554 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 13:55:55,555 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 13:55:55,557 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 13:55:55,558 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 13:55:55,558 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 13:55:55,559 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 13:55:55,559 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 13:55:55,560 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 13:55:55,561 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 13:55:55,561 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 13:55:55,562 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 13:55:55,563 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 13:55:55,564 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 13:55:55,564 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 13:55:55,565 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 13:55:55,565 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 13:55:55,565 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 13:55:55,566 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 13:55:55,567 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 13:55:55,568 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 13:55:55,582 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 13:55:55,582 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 13:55:55,584 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 13:55:55,584 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 13:55:55,584 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 13:55:55,584 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 13:55:55,584 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 13:55:55,585 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 13:55:55,585 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 13:55:55,585 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 13:55:55,585 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 13:55:55,585 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 13:55:55,586 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 13:55:55,586 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 13:55:55,586 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 13:55:55,586 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 13:55:55,586 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 13:55:55,587 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 13:55:55,587 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 13:55:55,587 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 13:55:55,587 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 13:55:55,587 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 13:55:55,588 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 13:55:55,588 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 13:55:55,588 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 13:55:55,588 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 13:55:55,588 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 13:55:55,589 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 13:55:55,589 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 13:55:55,589 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 13:55:55,873 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 13:55:55,886 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 13:55:55,890 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 13:55:55,891 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 13:55:55,892 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 13:55:55,892 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix054_power.oepc.i [2019-12-18 13:55:55,960 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c10d0bb31/f0664942c04f4fd6b3b0bfbc53ecf5d2/FLAG6f52b92db [2019-12-18 13:55:56,443 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 13:55:56,444 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix054_power.oepc.i [2019-12-18 13:55:56,463 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c10d0bb31/f0664942c04f4fd6b3b0bfbc53ecf5d2/FLAG6f52b92db [2019-12-18 13:55:56,739 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c10d0bb31/f0664942c04f4fd6b3b0bfbc53ecf5d2 [2019-12-18 13:55:56,748 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 13:55:56,750 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 13:55:56,751 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 13:55:56,751 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 13:55:56,756 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 13:55:56,757 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:55:56" (1/1) ... [2019-12-18 13:55:56,760 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f54299f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:55:56, skipping insertion in model container [2019-12-18 13:55:56,760 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:55:56" (1/1) ... [2019-12-18 13:55:56,768 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 13:55:56,822 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 13:55:57,308 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:55:57,321 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 13:55:57,383 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:55:57,466 INFO L208 MainTranslator]: Completed translation [2019-12-18 13:55:57,467 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:55:57 WrapperNode [2019-12-18 13:55:57,467 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 13:55:57,468 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 13:55:57,468 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 13:55:57,468 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 13:55:57,477 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:55:57" (1/1) ... [2019-12-18 13:55:57,497 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:55:57" (1/1) ... [2019-12-18 13:55:57,527 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 13:55:57,527 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 13:55:57,527 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 13:55:57,527 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 13:55:57,537 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:55:57" (1/1) ... [2019-12-18 13:55:57,538 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:55:57" (1/1) ... [2019-12-18 13:55:57,541 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:55:57" (1/1) ... [2019-12-18 13:55:57,542 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:55:57" (1/1) ... [2019-12-18 13:55:57,554 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:55:57" (1/1) ... [2019-12-18 13:55:57,559 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:55:57" (1/1) ... [2019-12-18 13:55:57,562 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:55:57" (1/1) ... [2019-12-18 13:55:57,567 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 13:55:57,567 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 13:55:57,568 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 13:55:57,568 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 13:55:57,569 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:55:57" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 13:55:57,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 13:55:57,644 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 13:55:57,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 13:55:57,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 13:55:57,645 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 13:55:57,645 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 13:55:57,645 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 13:55:57,645 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 13:55:57,645 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 13:55:57,646 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 13:55:57,646 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 13:55:57,648 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 13:55:58,375 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 13:55:58,376 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 13:55:58,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:55:58 BoogieIcfgContainer [2019-12-18 13:55:58,377 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 13:55:58,379 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 13:55:58,379 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 13:55:58,383 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 13:55:58,384 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 01:55:56" (1/3) ... [2019-12-18 13:55:58,385 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15eee890 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:55:58, skipping insertion in model container [2019-12-18 13:55:58,385 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:55:57" (2/3) ... [2019-12-18 13:55:58,386 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15eee890 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:55:58, skipping insertion in model container [2019-12-18 13:55:58,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:55:58" (3/3) ... [2019-12-18 13:55:58,390 INFO L109 eAbstractionObserver]: Analyzing ICFG mix054_power.oepc.i [2019-12-18 13:55:58,401 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 13:55:58,401 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 13:55:58,412 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 13:55:58,413 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 13:55:58,451 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,452 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,452 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,453 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,453 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,453 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,454 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,454 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,455 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,455 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,455 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,455 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,456 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,456 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,456 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,457 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,457 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,457 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,459 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,459 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,459 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,461 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,461 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,461 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,461 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,464 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,464 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,472 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,472 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,472 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,473 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,473 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,473 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,473 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,474 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,474 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,474 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,474 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,475 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,475 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,475 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,475 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,476 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,476 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,476 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,476 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,476 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,477 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,477 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,477 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,477 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,478 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,478 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,478 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,478 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,479 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,479 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,479 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,479 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,480 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,480 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,480 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,480 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,481 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,481 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,481 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,482 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,482 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,482 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,482 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,483 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,483 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,483 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,483 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,484 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,484 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,484 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,484 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,485 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,485 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,485 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,485 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,485 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,486 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,486 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,486 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,486 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,487 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,487 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,487 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,487 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,488 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,488 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,488 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,488 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,489 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,489 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,489 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,489 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,490 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,490 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,490 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,490 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,491 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,491 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,491 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,491 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,496 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,497 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,497 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,497 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,513 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,513 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,513 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,513 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,514 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,514 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,514 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,514 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,520 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,523 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:55:58,539 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 13:55:58,560 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 13:55:58,560 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 13:55:58,560 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 13:55:58,560 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 13:55:58,560 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 13:55:58,561 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 13:55:58,561 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 13:55:58,561 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 13:55:58,579 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 146 places, 180 transitions [2019-12-18 13:55:58,581 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-12-18 13:55:58,658 INFO L126 PetriNetUnfolder]: 41/178 cut-off events. [2019-12-18 13:55:58,658 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:55:58,674 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 345 event pairs. 6/141 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 13:55:58,694 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-12-18 13:55:58,732 INFO L126 PetriNetUnfolder]: 41/178 cut-off events. [2019-12-18 13:55:58,733 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:55:58,739 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 345 event pairs. 6/141 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 13:55:58,753 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-18 13:55:58,754 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 13:56:03,577 WARN L192 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2019-12-18 13:56:03,711 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-12-18 13:56:04,085 INFO L206 etLargeBlockEncoding]: Checked pairs total: 74785 [2019-12-18 13:56:04,086 INFO L214 etLargeBlockEncoding]: Total number of compositions: 109 [2019-12-18 13:56:04,091 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 75 places, 85 transitions [2019-12-18 13:56:05,140 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8582 states. [2019-12-18 13:56:05,142 INFO L276 IsEmpty]: Start isEmpty. Operand 8582 states. [2019-12-18 13:56:05,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 13:56:05,149 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:56:05,150 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 13:56:05,151 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:56:05,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:56:05,157 INFO L82 PathProgramCache]: Analyzing trace with hash 791214, now seen corresponding path program 1 times [2019-12-18 13:56:05,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:56:05,169 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133456672] [2019-12-18 13:56:05,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:56:05,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:56:05,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:56:05,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133456672] [2019-12-18 13:56:05,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:56:05,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 13:56:05,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257915538] [2019-12-18 13:56:05,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:56:05,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:56:05,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:56:05,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:56:05,465 INFO L87 Difference]: Start difference. First operand 8582 states. Second operand 3 states. [2019-12-18 13:56:05,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:56:05,749 INFO L93 Difference]: Finished difference Result 8460 states and 27514 transitions. [2019-12-18 13:56:05,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:56:05,751 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 13:56:05,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:56:05,838 INFO L225 Difference]: With dead ends: 8460 [2019-12-18 13:56:05,839 INFO L226 Difference]: Without dead ends: 7472 [2019-12-18 13:56:05,840 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:56:05,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7472 states. [2019-12-18 13:56:06,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7472 to 7472. [2019-12-18 13:56:06,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7472 states. [2019-12-18 13:56:06,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7472 states to 7472 states and 24214 transitions. [2019-12-18 13:56:06,198 INFO L78 Accepts]: Start accepts. Automaton has 7472 states and 24214 transitions. Word has length 3 [2019-12-18 13:56:06,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:56:06,199 INFO L462 AbstractCegarLoop]: Abstraction has 7472 states and 24214 transitions. [2019-12-18 13:56:06,199 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:56:06,199 INFO L276 IsEmpty]: Start isEmpty. Operand 7472 states and 24214 transitions. [2019-12-18 13:56:06,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 13:56:06,202 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:56:06,203 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:56:06,203 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:56:06,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:56:06,203 INFO L82 PathProgramCache]: Analyzing trace with hash 743461303, now seen corresponding path program 1 times [2019-12-18 13:56:06,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:56:06,204 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503118223] [2019-12-18 13:56:06,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:56:06,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:56:06,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:56:06,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503118223] [2019-12-18 13:56:06,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:56:06,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:56:06,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289962762] [2019-12-18 13:56:06,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:56:06,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:56:06,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:56:06,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:56:06,312 INFO L87 Difference]: Start difference. First operand 7472 states and 24214 transitions. Second operand 4 states. [2019-12-18 13:56:06,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:56:06,632 INFO L93 Difference]: Finished difference Result 11704 states and 36249 transitions. [2019-12-18 13:56:06,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:56:06,632 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 13:56:06,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:56:06,703 INFO L225 Difference]: With dead ends: 11704 [2019-12-18 13:56:06,703 INFO L226 Difference]: Without dead ends: 11690 [2019-12-18 13:56:06,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:56:06,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11690 states. [2019-12-18 13:56:07,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11690 to 10458. [2019-12-18 13:56:07,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10458 states. [2019-12-18 13:56:07,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10458 states to 10458 states and 32991 transitions. [2019-12-18 13:56:07,189 INFO L78 Accepts]: Start accepts. Automaton has 10458 states and 32991 transitions. Word has length 11 [2019-12-18 13:56:07,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:56:07,190 INFO L462 AbstractCegarLoop]: Abstraction has 10458 states and 32991 transitions. [2019-12-18 13:56:07,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:56:07,190 INFO L276 IsEmpty]: Start isEmpty. Operand 10458 states and 32991 transitions. [2019-12-18 13:56:07,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 13:56:07,195 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:56:07,195 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:56:07,195 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:56:07,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:56:07,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1209900993, now seen corresponding path program 1 times [2019-12-18 13:56:07,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:56:07,196 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177730388] [2019-12-18 13:56:07,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:56:07,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:56:07,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:56:07,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177730388] [2019-12-18 13:56:07,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:56:07,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:56:07,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31828803] [2019-12-18 13:56:07,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:56:07,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:56:07,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:56:07,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:56:07,308 INFO L87 Difference]: Start difference. First operand 10458 states and 32991 transitions. Second operand 5 states. [2019-12-18 13:56:07,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:56:07,681 INFO L93 Difference]: Finished difference Result 15000 states and 46671 transitions. [2019-12-18 13:56:07,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 13:56:07,682 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-18 13:56:07,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:56:07,734 INFO L225 Difference]: With dead ends: 15000 [2019-12-18 13:56:07,734 INFO L226 Difference]: Without dead ends: 15000 [2019-12-18 13:56:07,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:56:08,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15000 states. [2019-12-18 13:56:08,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15000 to 11886. [2019-12-18 13:56:08,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11886 states. [2019-12-18 13:56:08,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11886 states to 11886 states and 37489 transitions. [2019-12-18 13:56:08,805 INFO L78 Accepts]: Start accepts. Automaton has 11886 states and 37489 transitions. Word has length 14 [2019-12-18 13:56:08,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:56:08,807 INFO L462 AbstractCegarLoop]: Abstraction has 11886 states and 37489 transitions. [2019-12-18 13:56:08,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:56:08,807 INFO L276 IsEmpty]: Start isEmpty. Operand 11886 states and 37489 transitions. [2019-12-18 13:56:08,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 13:56:08,811 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:56:08,811 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:56:08,811 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:56:08,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:56:08,812 INFO L82 PathProgramCache]: Analyzing trace with hash 529414606, now seen corresponding path program 1 times [2019-12-18 13:56:08,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:56:08,812 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686678211] [2019-12-18 13:56:08,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:56:08,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:56:08,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:56:08,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686678211] [2019-12-18 13:56:08,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:56:08,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 13:56:08,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986594162] [2019-12-18 13:56:08,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:56:08,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:56:08,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:56:08,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:56:08,861 INFO L87 Difference]: Start difference. First operand 11886 states and 37489 transitions. Second operand 3 states. [2019-12-18 13:56:08,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:56:08,919 INFO L93 Difference]: Finished difference Result 11883 states and 37480 transitions. [2019-12-18 13:56:08,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:56:08,919 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-18 13:56:08,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:56:08,953 INFO L225 Difference]: With dead ends: 11883 [2019-12-18 13:56:08,953 INFO L226 Difference]: Without dead ends: 11883 [2019-12-18 13:56:08,954 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:56:09,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11883 states. [2019-12-18 13:56:09,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11883 to 11883. [2019-12-18 13:56:09,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11883 states. [2019-12-18 13:56:09,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11883 states to 11883 states and 37480 transitions. [2019-12-18 13:56:09,400 INFO L78 Accepts]: Start accepts. Automaton has 11883 states and 37480 transitions. Word has length 16 [2019-12-18 13:56:09,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:56:09,402 INFO L462 AbstractCegarLoop]: Abstraction has 11883 states and 37480 transitions. [2019-12-18 13:56:09,402 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:56:09,402 INFO L276 IsEmpty]: Start isEmpty. Operand 11883 states and 37480 transitions. [2019-12-18 13:56:09,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 13:56:09,406 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:56:09,406 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:56:09,407 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:56:09,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:56:09,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1491434984, now seen corresponding path program 1 times [2019-12-18 13:56:09,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:56:09,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647417850] [2019-12-18 13:56:09,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:56:09,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:56:09,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:56:09,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647417850] [2019-12-18 13:56:09,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:56:09,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:56:09,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515532820] [2019-12-18 13:56:09,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:56:09,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:56:09,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:56:09,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:56:09,501 INFO L87 Difference]: Start difference. First operand 11883 states and 37480 transitions. Second operand 3 states. [2019-12-18 13:56:09,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:56:09,581 INFO L93 Difference]: Finished difference Result 19949 states and 62561 transitions. [2019-12-18 13:56:09,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:56:09,581 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-18 13:56:09,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:56:09,603 INFO L225 Difference]: With dead ends: 19949 [2019-12-18 13:56:09,603 INFO L226 Difference]: Without dead ends: 11074 [2019-12-18 13:56:09,604 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:56:09,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11074 states. [2019-12-18 13:56:09,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11074 to 10421. [2019-12-18 13:56:09,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10421 states. [2019-12-18 13:56:09,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10421 states to 10421 states and 32037 transitions. [2019-12-18 13:56:09,909 INFO L78 Accepts]: Start accepts. Automaton has 10421 states and 32037 transitions. Word has length 17 [2019-12-18 13:56:09,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:56:09,909 INFO L462 AbstractCegarLoop]: Abstraction has 10421 states and 32037 transitions. [2019-12-18 13:56:09,909 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:56:09,909 INFO L276 IsEmpty]: Start isEmpty. Operand 10421 states and 32037 transitions. [2019-12-18 13:56:09,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 13:56:09,914 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:56:09,914 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:56:09,914 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:56:09,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:56:09,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1843431322, now seen corresponding path program 1 times [2019-12-18 13:56:09,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:56:09,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030131961] [2019-12-18 13:56:09,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:56:09,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:56:09,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:56:09,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030131961] [2019-12-18 13:56:09,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:56:09,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:56:09,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351382213] [2019-12-18 13:56:09,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:56:09,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:56:09,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:56:09,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:56:09,969 INFO L87 Difference]: Start difference. First operand 10421 states and 32037 transitions. Second operand 3 states. [2019-12-18 13:56:10,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:56:10,150 INFO L93 Difference]: Finished difference Result 10421 states and 31528 transitions. [2019-12-18 13:56:10,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:56:10,151 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-18 13:56:10,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:56:10,165 INFO L225 Difference]: With dead ends: 10421 [2019-12-18 13:56:10,166 INFO L226 Difference]: Without dead ends: 10421 [2019-12-18 13:56:10,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:56:10,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10421 states. [2019-12-18 13:56:10,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10421 to 10413. [2019-12-18 13:56:10,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10413 states. [2019-12-18 13:56:10,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10413 states to 10413 states and 31512 transitions. [2019-12-18 13:56:10,424 INFO L78 Accepts]: Start accepts. Automaton has 10413 states and 31512 transitions. Word has length 17 [2019-12-18 13:56:10,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:56:10,425 INFO L462 AbstractCegarLoop]: Abstraction has 10413 states and 31512 transitions. [2019-12-18 13:56:10,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:56:10,425 INFO L276 IsEmpty]: Start isEmpty. Operand 10413 states and 31512 transitions. [2019-12-18 13:56:10,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 13:56:10,429 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:56:10,429 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:56:10,429 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:56:10,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:56:10,429 INFO L82 PathProgramCache]: Analyzing trace with hash 783398497, now seen corresponding path program 1 times [2019-12-18 13:56:10,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:56:10,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682338419] [2019-12-18 13:56:10,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:56:10,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:56:10,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:56:10,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682338419] [2019-12-18 13:56:10,485 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:56:10,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:56:10,485 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690299216] [2019-12-18 13:56:10,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:56:10,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:56:10,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:56:10,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:56:10,487 INFO L87 Difference]: Start difference. First operand 10413 states and 31512 transitions. Second operand 4 states. [2019-12-18 13:56:10,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:56:10,530 INFO L93 Difference]: Finished difference Result 1753 states and 4291 transitions. [2019-12-18 13:56:10,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:56:10,531 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-18 13:56:10,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:56:10,533 INFO L225 Difference]: With dead ends: 1753 [2019-12-18 13:56:10,533 INFO L226 Difference]: Without dead ends: 1247 [2019-12-18 13:56:10,533 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:56:10,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1247 states. [2019-12-18 13:56:10,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1247 to 1247. [2019-12-18 13:56:10,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1247 states. [2019-12-18 13:56:10,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1247 states to 1247 states and 2704 transitions. [2019-12-18 13:56:10,553 INFO L78 Accepts]: Start accepts. Automaton has 1247 states and 2704 transitions. Word has length 17 [2019-12-18 13:56:10,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:56:10,553 INFO L462 AbstractCegarLoop]: Abstraction has 1247 states and 2704 transitions. [2019-12-18 13:56:10,553 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:56:10,554 INFO L276 IsEmpty]: Start isEmpty. Operand 1247 states and 2704 transitions. [2019-12-18 13:56:10,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 13:56:10,555 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:56:10,555 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:56:10,556 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:56:10,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:56:10,556 INFO L82 PathProgramCache]: Analyzing trace with hash 702739982, now seen corresponding path program 1 times [2019-12-18 13:56:10,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:56:10,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51636560] [2019-12-18 13:56:10,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:56:10,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:56:10,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:56:10,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51636560] [2019-12-18 13:56:10,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:56:10,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:56:10,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79708688] [2019-12-18 13:56:10,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:56:10,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:56:10,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:56:10,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:56:10,638 INFO L87 Difference]: Start difference. First operand 1247 states and 2704 transitions. Second operand 6 states. [2019-12-18 13:56:10,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:56:10,953 INFO L93 Difference]: Finished difference Result 1303 states and 2774 transitions. [2019-12-18 13:56:10,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 13:56:10,953 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-18 13:56:10,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:56:10,955 INFO L225 Difference]: With dead ends: 1303 [2019-12-18 13:56:10,955 INFO L226 Difference]: Without dead ends: 1252 [2019-12-18 13:56:10,956 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-18 13:56:10,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1252 states. [2019-12-18 13:56:10,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1252 to 1193. [2019-12-18 13:56:10,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1193 states. [2019-12-18 13:56:10,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 1193 states and 2589 transitions. [2019-12-18 13:56:10,978 INFO L78 Accepts]: Start accepts. Automaton has 1193 states and 2589 transitions. Word has length 25 [2019-12-18 13:56:10,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:56:10,978 INFO L462 AbstractCegarLoop]: Abstraction has 1193 states and 2589 transitions. [2019-12-18 13:56:10,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:56:10,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1193 states and 2589 transitions. [2019-12-18 13:56:10,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 13:56:10,980 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:56:10,980 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:56:10,981 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:56:10,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:56:10,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1134333202, now seen corresponding path program 1 times [2019-12-18 13:56:10,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:56:10,981 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656335375] [2019-12-18 13:56:10,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:56:11,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:56:11,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:56:11,088 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656335375] [2019-12-18 13:56:11,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:56:11,088 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:56:11,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788588148] [2019-12-18 13:56:11,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:56:11,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:56:11,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:56:11,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:56:11,091 INFO L87 Difference]: Start difference. First operand 1193 states and 2589 transitions. Second operand 5 states. [2019-12-18 13:56:11,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:56:11,139 INFO L93 Difference]: Finished difference Result 634 states and 1350 transitions. [2019-12-18 13:56:11,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:56:11,140 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-18 13:56:11,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:56:11,141 INFO L225 Difference]: With dead ends: 634 [2019-12-18 13:56:11,141 INFO L226 Difference]: Without dead ends: 500 [2019-12-18 13:56:11,141 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:56:11,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2019-12-18 13:56:11,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 500. [2019-12-18 13:56:11,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-12-18 13:56:11,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 1104 transitions. [2019-12-18 13:56:11,150 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 1104 transitions. Word has length 28 [2019-12-18 13:56:11,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:56:11,150 INFO L462 AbstractCegarLoop]: Abstraction has 500 states and 1104 transitions. [2019-12-18 13:56:11,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:56:11,150 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 1104 transitions. [2019-12-18 13:56:11,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 13:56:11,152 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:56:11,152 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:56:11,153 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:56:11,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:56:11,153 INFO L82 PathProgramCache]: Analyzing trace with hash 2108814601, now seen corresponding path program 1 times [2019-12-18 13:56:11,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:56:11,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959798456] [2019-12-18 13:56:11,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:56:11,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:56:11,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:56:11,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959798456] [2019-12-18 13:56:11,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:56:11,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:56:11,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884881828] [2019-12-18 13:56:11,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:56:11,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:56:11,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:56:11,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:56:11,199 INFO L87 Difference]: Start difference. First operand 500 states and 1104 transitions. Second operand 3 states. [2019-12-18 13:56:11,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:56:11,248 INFO L93 Difference]: Finished difference Result 752 states and 1608 transitions. [2019-12-18 13:56:11,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:56:11,248 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-18 13:56:11,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:56:11,250 INFO L225 Difference]: With dead ends: 752 [2019-12-18 13:56:11,250 INFO L226 Difference]: Without dead ends: 752 [2019-12-18 13:56:11,250 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:56:11,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2019-12-18 13:56:11,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 560. [2019-12-18 13:56:11,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 560 states. [2019-12-18 13:56:11,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 1224 transitions. [2019-12-18 13:56:11,262 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 1224 transitions. Word has length 52 [2019-12-18 13:56:11,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:56:11,263 INFO L462 AbstractCegarLoop]: Abstraction has 560 states and 1224 transitions. [2019-12-18 13:56:11,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:56:11,263 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 1224 transitions. [2019-12-18 13:56:11,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 13:56:11,266 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:56:11,266 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:56:11,266 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:56:11,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:56:11,266 INFO L82 PathProgramCache]: Analyzing trace with hash -525709791, now seen corresponding path program 1 times [2019-12-18 13:56:11,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:56:11,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488711719] [2019-12-18 13:56:11,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:56:11,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:56:11,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:56:11,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488711719] [2019-12-18 13:56:11,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:56:11,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:56:11,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114158586] [2019-12-18 13:56:11,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:56:11,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:56:11,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:56:11,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:56:11,375 INFO L87 Difference]: Start difference. First operand 560 states and 1224 transitions. Second operand 7 states. [2019-12-18 13:56:11,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:56:11,594 INFO L93 Difference]: Finished difference Result 1089 states and 2305 transitions. [2019-12-18 13:56:11,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 13:56:11,595 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-12-18 13:56:11,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:56:11,596 INFO L225 Difference]: With dead ends: 1089 [2019-12-18 13:56:11,596 INFO L226 Difference]: Without dead ends: 766 [2019-12-18 13:56:11,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-18 13:56:11,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2019-12-18 13:56:11,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 613. [2019-12-18 13:56:11,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2019-12-18 13:56:11,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 1309 transitions. [2019-12-18 13:56:11,608 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 1309 transitions. Word has length 52 [2019-12-18 13:56:11,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:56:11,608 INFO L462 AbstractCegarLoop]: Abstraction has 613 states and 1309 transitions. [2019-12-18 13:56:11,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:56:11,608 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 1309 transitions. [2019-12-18 13:56:11,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 13:56:11,611 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:56:11,611 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:56:11,611 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:56:11,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:56:11,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1253874511, now seen corresponding path program 2 times [2019-12-18 13:56:11,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:56:11,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117218079] [2019-12-18 13:56:11,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:56:11,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:56:11,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:56:11,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117218079] [2019-12-18 13:56:11,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:56:11,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 13:56:11,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833591639] [2019-12-18 13:56:11,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 13:56:11,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:56:11,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 13:56:11,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-18 13:56:11,744 INFO L87 Difference]: Start difference. First operand 613 states and 1309 transitions. Second operand 8 states. [2019-12-18 13:56:12,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:56:12,405 INFO L93 Difference]: Finished difference Result 1183 states and 2418 transitions. [2019-12-18 13:56:12,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 13:56:12,406 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2019-12-18 13:56:12,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:56:12,408 INFO L225 Difference]: With dead ends: 1183 [2019-12-18 13:56:12,409 INFO L226 Difference]: Without dead ends: 1159 [2019-12-18 13:56:12,409 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-12-18 13:56:12,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2019-12-18 13:56:12,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 838. [2019-12-18 13:56:12,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2019-12-18 13:56:12,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1780 transitions. [2019-12-18 13:56:12,422 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1780 transitions. Word has length 52 [2019-12-18 13:56:12,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:56:12,423 INFO L462 AbstractCegarLoop]: Abstraction has 838 states and 1780 transitions. [2019-12-18 13:56:12,423 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 13:56:12,423 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1780 transitions. [2019-12-18 13:56:12,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 13:56:12,425 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:56:12,425 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:56:12,426 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:56:12,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:56:12,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1667381275, now seen corresponding path program 3 times [2019-12-18 13:56:12,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:56:12,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501833500] [2019-12-18 13:56:12,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:56:12,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:56:12,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:56:12,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501833500] [2019-12-18 13:56:12,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:56:12,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:56:12,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758219816] [2019-12-18 13:56:12,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:56:12,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:56:12,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:56:12,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:56:12,536 INFO L87 Difference]: Start difference. First operand 838 states and 1780 transitions. Second operand 4 states. [2019-12-18 13:56:12,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:56:12,591 INFO L93 Difference]: Finished difference Result 1025 states and 2169 transitions. [2019-12-18 13:56:12,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:56:12,592 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-12-18 13:56:12,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:56:12,594 INFO L225 Difference]: With dead ends: 1025 [2019-12-18 13:56:12,594 INFO L226 Difference]: Without dead ends: 1025 [2019-12-18 13:56:12,595 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:56:12,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1025 states. [2019-12-18 13:56:12,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1025 to 803. [2019-12-18 13:56:12,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2019-12-18 13:56:12,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1726 transitions. [2019-12-18 13:56:12,609 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1726 transitions. Word has length 52 [2019-12-18 13:56:12,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:56:12,610 INFO L462 AbstractCegarLoop]: Abstraction has 803 states and 1726 transitions. [2019-12-18 13:56:12,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:56:12,610 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1726 transitions. [2019-12-18 13:56:12,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 13:56:12,612 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:56:12,612 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:56:12,613 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:56:12,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:56:12,613 INFO L82 PathProgramCache]: Analyzing trace with hash -288059161, now seen corresponding path program 1 times [2019-12-18 13:56:12,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:56:12,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820852905] [2019-12-18 13:56:12,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:56:12,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:56:12,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:56:12,788 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 13:56:12,788 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 13:56:12,792 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] ULTIMATE.startENTRY-->L792: Formula: (let ((.cse0 (store |v_#valid_59| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~y$r_buff1_thd2~0_239) (= 0 v_~y$flush_delayed~0_31) (= v_~main$tmp_guard0~0_30 0) (= v_~x~0_98 0) (= v_~y~0_135 0) (= |v_#NULL.offset_3| 0) (= v_~y$mem_tmp~0_22 0) (= v_~y$r_buff1_thd1~0_110 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1441~0.base_35| 1) |v_#valid_57|) (= v_~y$r_buff0_thd1~0_187 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1441~0.base_35| 4)) (= 0 v_~__unbuffered_p1_EAX~0_38) (= v_~y$w_buff0_used~0_704 0) (= v_~main$tmp_guard1~0_45 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1441~0.base_35|)) (= v_~y$r_buff0_thd0~0_135 0) (= v_~y$r_buff1_thd0~0_153 0) (= v_~y$read_delayed~0_6 0) (= 0 v_~__unbuffered_cnt~0_51) (< 0 |v_#StackHeapBarrier_14|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1441~0.base_35| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1441~0.base_35|) |v_ULTIMATE.start_main_~#t1441~0.offset_27| 0)) |v_#memory_int_15|) (= 0 v_~y$r_buff0_thd2~0_327) (= 0 v_~weak$$choice0~0_20) (= v_~y$w_buff1_used~0_445 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1441~0.base_35|) (= 0 |v_#NULL.base_3|) (= |v_ULTIMATE.start_main_~#t1441~0.offset_27| 0) (= v_~weak$$choice2~0_107 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~y$w_buff1~0_286 0) (= 0 v_~y$w_buff0~0_484))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_704, #NULL.offset=|v_#NULL.offset_3|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_45, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_27|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_39|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_78|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_47|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_110, ~y$mem_tmp~0=v_~y$mem_tmp~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_38, ~y$w_buff0~0=v_~y$w_buff0~0_484, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_187, ~y$flush_delayed~0=v_~y$flush_delayed~0_31, #length=|v_#length_17|, ULTIMATE.start_main_~#t1441~0.base=|v_ULTIMATE.start_main_~#t1441~0.base_35|, ~y~0=v_~y~0_135, ULTIMATE.start_main_~#t1442~0.offset=|v_ULTIMATE.start_main_~#t1442~0.offset_15|, ULTIMATE.start_main_~#t1442~0.base=|v_ULTIMATE.start_main_~#t1442~0.base_17|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, #NULL.base=|v_#NULL.base_3|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_239, ~weak$$choice0~0=v_~weak$$choice0~0_20, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_102|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_77|, ~y$w_buff1~0=v_~y$w_buff1~0_286, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_~#t1441~0.offset=|v_ULTIMATE.start_main_~#t1441~0.offset_27|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_32|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_135, #valid=|v_#valid_57|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_327, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_20|, ~weak$$choice2~0=v_~weak$$choice2~0_107, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_153, ~x~0=v_~x~0_98, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_445} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_~#t1441~0.base, ~y~0, ULTIMATE.start_main_~#t1442~0.offset, ULTIMATE.start_main_~#t1442~0.base, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_~#t1441~0.offset, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 13:56:12,794 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L4-->L736: Formula: (and (= 1 ~y$r_buff0_thd1~0_Out677786291) (= ~y$r_buff0_thd2~0_In677786291 ~y$r_buff1_thd2~0_Out677786291) (= ~x~0_Out677786291 1) (not (= P0Thread1of1ForFork0___VERIFIER_assert_~expression_In677786291 0)) (= ~y$r_buff0_thd1~0_In677786291 ~y$r_buff1_thd1~0_Out677786291) (= ~y$r_buff1_thd0~0_Out677786291 ~y$r_buff0_thd0~0_In677786291)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In677786291, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In677786291, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In677786291, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In677786291} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out677786291, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out677786291, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In677786291, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out677786291, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In677786291, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In677786291, ~x~0=~x~0_Out677786291, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out677786291} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff0_thd1~0, ~x~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-18 13:56:12,795 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L792-1-->L794: Formula: (and (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1442~0.base_11|)) (= (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1442~0.base_11| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1442~0.base_11|) |v_ULTIMATE.start_main_~#t1442~0.offset_10| 1)) |v_#memory_int_7|) (= |v_ULTIMATE.start_main_~#t1442~0.offset_10| 0) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t1442~0.base_11| 4) |v_#length_9|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1442~0.base_11|) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1442~0.base_11| 1)) (not (= |v_ULTIMATE.start_main_~#t1442~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t1442~0.offset=|v_ULTIMATE.start_main_~#t1442~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, ULTIMATE.start_main_~#t1442~0.base=|v_ULTIMATE.start_main_~#t1442~0.base_11|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1442~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t1442~0.base, #length] because there is no mapped edge [2019-12-18 13:56:12,799 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L737-->L737-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In673507950 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In673507950 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out673507950|)) (and (= ~y$w_buff0_used~0_In673507950 |P0Thread1of1ForFork0_#t~ite5_Out673507950|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In673507950, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In673507950} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out673507950|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In673507950, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In673507950} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 13:56:12,800 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L758-->L758-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In2121593893 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite14_Out2121593893| ~y$w_buff0~0_In2121593893) (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In2121593893 256) 0))) (or (and .cse0 (= 0 (mod ~y$r_buff1_thd2~0_In2121593893 256))) (and .cse0 (= (mod ~y$w_buff1_used~0_In2121593893 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In2121593893 256)))) .cse1 (= |P1Thread1of1ForFork1_#t~ite14_Out2121593893| |P1Thread1of1ForFork1_#t~ite15_Out2121593893|)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite15_Out2121593893| ~y$w_buff0~0_In2121593893) (= |P1Thread1of1ForFork1_#t~ite14_In2121593893| |P1Thread1of1ForFork1_#t~ite14_Out2121593893|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2121593893, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2121593893, ~y$w_buff0~0=~y$w_buff0~0_In2121593893, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2121593893, ~weak$$choice2~0=~weak$$choice2~0_In2121593893, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In2121593893|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2121593893} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2121593893, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2121593893, ~y$w_buff0~0=~y$w_buff0~0_In2121593893, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2121593893, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out2121593893|, ~weak$$choice2~0=~weak$$choice2~0_In2121593893, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out2121593893|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2121593893} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 13:56:12,802 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L760-->L760-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In504232979 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite20_In504232979| |P1Thread1of1ForFork1_#t~ite20_Out504232979|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite21_Out504232979| ~y$w_buff0_used~0_In504232979)) (and (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In504232979 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In504232979 256)) (and (= (mod ~y$w_buff1_used~0_In504232979 256) 0) .cse1) (and (= 0 (mod ~y$r_buff1_thd2~0_In504232979 256)) .cse1))) (= |P1Thread1of1ForFork1_#t~ite21_Out504232979| |P1Thread1of1ForFork1_#t~ite20_Out504232979|) .cse0 (= |P1Thread1of1ForFork1_#t~ite20_Out504232979| ~y$w_buff0_used~0_In504232979)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In504232979, ~y$w_buff0_used~0=~y$w_buff0_used~0_In504232979, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In504232979|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In504232979, ~weak$$choice2~0=~weak$$choice2~0_In504232979, ~y$w_buff1_used~0=~y$w_buff1_used~0_In504232979} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In504232979, ~y$w_buff0_used~0=~y$w_buff0_used~0_In504232979, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out504232979|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In504232979, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out504232979|, ~weak$$choice2~0=~weak$$choice2~0_In504232979, ~y$w_buff1_used~0=~y$w_buff1_used~0_In504232979} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-18 13:56:12,804 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [653] [653] L762-->L763: Formula: (and (not (= (mod v_~weak$$choice2~0_18 256) 0)) (= v_~y$r_buff0_thd2~0_68 v_~y$r_buff0_thd2~0_67)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_68, ~weak$$choice2~0=v_~weak$$choice2~0_18} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_67, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_7|, ~weak$$choice2~0=v_~weak$$choice2~0_18, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_13|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_7|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-18 13:56:12,804 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L763-->L763-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1910612398 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite29_In-1910612398| |P1Thread1of1ForFork1_#t~ite29_Out-1910612398|) (= ~y$r_buff1_thd2~0_In-1910612398 |P1Thread1of1ForFork1_#t~ite30_Out-1910612398|)) (and (= |P1Thread1of1ForFork1_#t~ite30_Out-1910612398| |P1Thread1of1ForFork1_#t~ite29_Out-1910612398|) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1910612398 256)))) (or (= (mod ~y$w_buff0_used~0_In-1910612398 256) 0) (and (= 0 (mod ~y$r_buff1_thd2~0_In-1910612398 256)) .cse1) (and (= (mod ~y$w_buff1_used~0_In-1910612398 256) 0) .cse1))) (= ~y$r_buff1_thd2~0_In-1910612398 |P1Thread1of1ForFork1_#t~ite29_Out-1910612398|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1910612398, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-1910612398|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1910612398, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1910612398, ~weak$$choice2~0=~weak$$choice2~0_In-1910612398, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1910612398} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1910612398, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-1910612398|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-1910612398|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1910612398, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1910612398, ~weak$$choice2~0=~weak$$choice2~0_In-1910612398, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1910612398} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-18 13:56:12,805 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L765-->L769: Formula: (and (= 0 v_~y$flush_delayed~0_8) (= v_~y~0_24 v_~y$mem_tmp~0_6) (not (= 0 (mod v_~y$flush_delayed~0_9 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_6, ~y$flush_delayed~0=v_~y$flush_delayed~0_9} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_6, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~y~0=v_~y~0_24} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-18 13:56:12,806 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L769-2-->L769-5: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-1406033359 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-1406033359 256) 0)) (.cse2 (= |P1Thread1of1ForFork1_#t~ite33_Out-1406033359| |P1Thread1of1ForFork1_#t~ite32_Out-1406033359|))) (or (and (= ~y~0_In-1406033359 |P1Thread1of1ForFork1_#t~ite32_Out-1406033359|) (or .cse0 .cse1) .cse2) (and (not .cse1) (not .cse0) .cse2 (= ~y$w_buff1~0_In-1406033359 |P1Thread1of1ForFork1_#t~ite32_Out-1406033359|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1406033359, ~y$w_buff1~0=~y$w_buff1~0_In-1406033359, ~y~0=~y~0_In-1406033359, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1406033359} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1406033359, ~y$w_buff1~0=~y$w_buff1~0_In-1406033359, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-1406033359|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out-1406033359|, ~y~0=~y~0_In-1406033359, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1406033359} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-18 13:56:12,806 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L770-->L770-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1138514106 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1138514106 256)))) (or (and (= ~y$w_buff0_used~0_In1138514106 |P1Thread1of1ForFork1_#t~ite34_Out1138514106|) (or .cse0 .cse1)) (and (= 0 |P1Thread1of1ForFork1_#t~ite34_Out1138514106|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1138514106, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1138514106} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1138514106, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1138514106, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out1138514106|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 13:56:12,807 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L771-->L771-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd2~0_In-1781874751 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-1781874751 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1781874751 256))) (.cse2 (= (mod ~y$r_buff0_thd2~0_In-1781874751 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite35_Out-1781874751| ~y$w_buff1_used~0_In-1781874751) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork1_#t~ite35_Out-1781874751|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1781874751, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1781874751, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1781874751, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1781874751} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1781874751, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1781874751, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1781874751, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-1781874751|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1781874751} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 13:56:12,808 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L772-->L772-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In1031590977 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1031590977 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite36_Out1031590977|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd2~0_In1031590977 |P1Thread1of1ForFork1_#t~ite36_Out1031590977|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1031590977, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1031590977} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1031590977, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1031590977, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out1031590977|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-18 13:56:12,808 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L773-->L773-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd2~0_In-52595865 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-52595865 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-52595865 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-52595865 256)))) (or (and (= ~y$r_buff1_thd2~0_In-52595865 |P1Thread1of1ForFork1_#t~ite37_Out-52595865|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork1_#t~ite37_Out-52595865| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-52595865, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-52595865, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-52595865, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-52595865} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-52595865, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-52595865, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-52595865, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-52595865|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-52595865} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 13:56:12,809 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L773-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y$r_buff1_thd2~0_151 |v_P1Thread1of1ForFork1_#t~ite37_32|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_32|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_151, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_31|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 13:56:12,809 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L738-->L738-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-325520211 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd1~0_In-325520211 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd1~0_In-325520211 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-325520211 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-325520211|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~y$w_buff1_used~0_In-325520211 |P0Thread1of1ForFork0_#t~ite6_Out-325520211|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-325520211, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-325520211, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-325520211, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-325520211} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-325520211|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-325520211, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-325520211, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-325520211, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-325520211} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 13:56:12,809 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L739-->L740: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In289291762 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In289291762 256)))) (or (and (not .cse0) (= ~y$r_buff0_thd1~0_Out289291762 0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd1~0_Out289291762 ~y$r_buff0_thd1~0_In289291762)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In289291762, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In289291762} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In289291762, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out289291762|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out289291762} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 13:56:12,810 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L740-->L740-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-159935090 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-159935090 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd1~0_In-159935090 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In-159935090 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out-159935090| 0)) (and (= |P0Thread1of1ForFork0_#t~ite8_Out-159935090| ~y$r_buff1_thd1~0_In-159935090) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-159935090, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-159935090, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-159935090, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-159935090} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-159935090, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-159935090, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-159935090|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-159935090, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-159935090} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 13:56:12,810 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L740-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_32 (+ v_~__unbuffered_cnt~0_33 1)) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~y$r_buff1_thd1~0_50 |v_P0Thread1of1ForFork0_#t~ite8_28|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_50, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_27|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 13:56:12,811 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L798-->L800-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= 0 (mod v_~y$w_buff0_used~0_276 256)) (= (mod v_~y$r_buff0_thd0~0_50 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_276, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_50, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_276, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_50, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 13:56:12,811 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L800-2-->L800-5: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-1900401075 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-1900401075 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite41_Out-1900401075| |ULTIMATE.start_main_#t~ite40_Out-1900401075|))) (or (and (= ~y~0_In-1900401075 |ULTIMATE.start_main_#t~ite40_Out-1900401075|) (or .cse0 .cse1) .cse2) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite40_Out-1900401075| ~y$w_buff1~0_In-1900401075) (not .cse1) .cse2))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1900401075, ~y~0=~y~0_In-1900401075, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1900401075, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1900401075} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-1900401075|, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1900401075|, ~y$w_buff1~0=~y$w_buff1~0_In-1900401075, ~y~0=~y~0_In-1900401075, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1900401075, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1900401075} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-18 13:56:12,811 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L801-->L801-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1779133072 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1779133072 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In1779133072 |ULTIMATE.start_main_#t~ite42_Out1779133072|)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite42_Out1779133072|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1779133072, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1779133072} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1779133072, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1779133072, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out1779133072|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 13:56:12,812 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L802-->L802-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In2057992047 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In2057992047 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In2057992047 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In2057992047 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite43_Out2057992047|)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~y$w_buff1_used~0_In2057992047 |ULTIMATE.start_main_#t~ite43_Out2057992047|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2057992047, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2057992047, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2057992047, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2057992047} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2057992047, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2057992047, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out2057992047|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2057992047, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2057992047} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 13:56:12,813 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L803-->L803-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In1968206866 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1968206866 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite44_Out1968206866|) (not .cse0) (not .cse1)) (and (= ~y$r_buff0_thd0~0_In1968206866 |ULTIMATE.start_main_#t~ite44_Out1968206866|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1968206866, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1968206866} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1968206866, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1968206866, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1968206866|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 13:56:12,814 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L804-->L804-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd0~0_In-2033202978 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In-2033202978 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-2033202978 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In-2033202978 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite45_Out-2033202978|)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite45_Out-2033202978| ~y$r_buff1_thd0~0_In-2033202978)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2033202978, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2033202978, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2033202978, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2033202978} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2033202978, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2033202978, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2033202978, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-2033202978|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2033202978} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 13:56:12,814 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L804-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_16 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~y$r_buff1_thd0~0_104 |v_ULTIMATE.start_main_#t~ite45_33|) (= 0 v_~__unbuffered_p1_EAX~0_18) (= v_~x~0_61 2) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 0)) InVars {~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ~x~0=v_~x~0_61, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_33|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~x~0=v_~x~0_61, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_104, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_32|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 13:56:12,912 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 01:56:12 BasicIcfg [2019-12-18 13:56:12,914 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 13:56:12,916 INFO L168 Benchmark]: Toolchain (without parser) took 16166.39 ms. Allocated memory was 144.7 MB in the beginning and 696.8 MB in the end (delta: 552.1 MB). Free memory was 101.1 MB in the beginning and 364.7 MB in the end (delta: -263.5 MB). Peak memory consumption was 288.6 MB. Max. memory is 7.1 GB. [2019-12-18 13:56:12,917 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-18 13:56:12,918 INFO L168 Benchmark]: CACSL2BoogieTranslator took 716.21 ms. Allocated memory was 144.7 MB in the beginning and 202.4 MB in the end (delta: 57.7 MB). Free memory was 100.7 MB in the beginning and 154.5 MB in the end (delta: -53.8 MB). Peak memory consumption was 20.3 MB. Max. memory is 7.1 GB. [2019-12-18 13:56:12,919 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.91 ms. Allocated memory is still 202.4 MB. Free memory was 154.5 MB in the beginning and 152.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-18 13:56:12,920 INFO L168 Benchmark]: Boogie Preprocessor took 40.07 ms. Allocated memory is still 202.4 MB. Free memory was 152.4 MB in the beginning and 149.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 13:56:12,920 INFO L168 Benchmark]: RCFGBuilder took 810.46 ms. Allocated memory is still 202.4 MB. Free memory was 149.7 MB in the beginning and 105.8 MB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 7.1 GB. [2019-12-18 13:56:12,925 INFO L168 Benchmark]: TraceAbstraction took 14535.10 ms. Allocated memory was 202.4 MB in the beginning and 696.8 MB in the end (delta: 494.4 MB). Free memory was 105.1 MB in the beginning and 364.7 MB in the end (delta: -259.6 MB). Peak memory consumption was 234.8 MB. Max. memory is 7.1 GB. [2019-12-18 13:56:12,933 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.23 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 716.21 ms. Allocated memory was 144.7 MB in the beginning and 202.4 MB in the end (delta: 57.7 MB). Free memory was 100.7 MB in the beginning and 154.5 MB in the end (delta: -53.8 MB). Peak memory consumption was 20.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 58.91 ms. Allocated memory is still 202.4 MB. Free memory was 154.5 MB in the beginning and 152.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.07 ms. Allocated memory is still 202.4 MB. Free memory was 152.4 MB in the beginning and 149.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 810.46 ms. Allocated memory is still 202.4 MB. Free memory was 149.7 MB in the beginning and 105.8 MB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14535.10 ms. Allocated memory was 202.4 MB in the beginning and 696.8 MB in the end (delta: 494.4 MB). Free memory was 105.1 MB in the beginning and 364.7 MB in the end (delta: -259.6 MB). Peak memory consumption was 234.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.5s, 146 ProgramPointsBefore, 75 ProgramPointsAfterwards, 180 TransitionsBefore, 85 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 12 FixpointIterations, 28 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 27 ChoiceCompositions, 4902 VarBasedMoverChecksPositive, 321 VarBasedMoverChecksNegative, 236 SemBasedMoverChecksPositive, 194 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 74785 CheckedPairsTotal, 109 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L792] FCALL, FORK 0 pthread_create(&t1441, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L722] 1 y$w_buff1 = y$w_buff0 [L723] 1 y$w_buff0 = 1 [L724] 1 y$w_buff1_used = y$w_buff0_used [L725] 1 y$w_buff0_used = (_Bool)1 [L736] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L794] FCALL, FORK 0 pthread_create(&t1442, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L750] 2 x = 2 [L753] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L754] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L755] 2 y$flush_delayed = weak$$choice2 [L756] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L757] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L758] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L759] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L737] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L760] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L761] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L761] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L763] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L764] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L769] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L770] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L771] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L772] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L738] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L796] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L800] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L801] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L802] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L803] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 140 locations, 2 error locations. Result: UNSAFE, OverallTime: 14.2s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1408 SDtfs, 1437 SDslu, 2581 SDs, 0 SdLazy, 1355 SolverSat, 80 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 71 GetRequests, 15 SyntacticMatches, 6 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11886occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 5954 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 409 NumberOfCodeBlocks, 409 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 343 ConstructedInterpolants, 0 QuantifiedInterpolants, 42503 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...