/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix041_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 21:12:20,746 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 21:12:20,749 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 21:12:20,761 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 21:12:20,761 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 21:12:20,762 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 21:12:20,763 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 21:12:20,765 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 21:12:20,767 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 21:12:20,767 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 21:12:20,768 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 21:12:20,770 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 21:12:20,770 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 21:12:20,771 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 21:12:20,772 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 21:12:20,773 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 21:12:20,774 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 21:12:20,774 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 21:12:20,776 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 21:12:20,778 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 21:12:20,779 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 21:12:20,780 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 21:12:20,781 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 21:12:20,782 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 21:12:20,784 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 21:12:20,784 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 21:12:20,785 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 21:12:20,786 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 21:12:20,786 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 21:12:20,787 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 21:12:20,787 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 21:12:20,788 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 21:12:20,789 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 21:12:20,790 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 21:12:20,791 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 21:12:20,791 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 21:12:20,791 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 21:12:20,792 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 21:12:20,792 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 21:12:20,793 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 21:12:20,793 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 21:12:20,794 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf [2019-12-27 21:12:20,808 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 21:12:20,808 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 21:12:20,809 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 21:12:20,810 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 21:12:20,810 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 21:12:20,810 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 21:12:20,810 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 21:12:20,810 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 21:12:20,811 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 21:12:20,811 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 21:12:20,811 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 21:12:20,811 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 21:12:20,811 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 21:12:20,812 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 21:12:20,812 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 21:12:20,812 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 21:12:20,812 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 21:12:20,812 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 21:12:20,813 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 21:12:20,813 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 21:12:20,813 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 21:12:20,813 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 21:12:20,813 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 21:12:20,814 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 21:12:20,814 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 21:12:20,814 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 21:12:20,814 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 21:12:20,814 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 21:12:20,815 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 21:12:20,815 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 21:12:20,815 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 21:12:20,815 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 21:12:21,084 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 21:12:21,099 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 21:12:21,103 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 21:12:21,105 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 21:12:21,105 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 21:12:21,106 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix041_pso.opt.i [2019-12-27 21:12:21,177 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4dc8efcad/4e7780841b3f448d935556917f3a50bc/FLAG103ed10d8 [2019-12-27 21:12:21,688 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 21:12:21,689 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix041_pso.opt.i [2019-12-27 21:12:21,704 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4dc8efcad/4e7780841b3f448d935556917f3a50bc/FLAG103ed10d8 [2019-12-27 21:12:22,010 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4dc8efcad/4e7780841b3f448d935556917f3a50bc [2019-12-27 21:12:22,018 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 21:12:22,020 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 21:12:22,021 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 21:12:22,021 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 21:12:22,026 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 21:12:22,027 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:12:22" (1/1) ... [2019-12-27 21:12:22,031 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@85f7a91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:12:22, skipping insertion in model container [2019-12-27 21:12:22,031 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:12:22" (1/1) ... [2019-12-27 21:12:22,039 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 21:12:22,099 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 21:12:22,571 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:12:22,587 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 21:12:22,679 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:12:22,785 INFO L208 MainTranslator]: Completed translation [2019-12-27 21:12:22,786 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:12:22 WrapperNode [2019-12-27 21:12:22,786 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 21:12:22,787 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 21:12:22,787 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 21:12:22,789 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 21:12:22,799 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:12:22" (1/1) ... [2019-12-27 21:12:22,819 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:12:22" (1/1) ... [2019-12-27 21:12:22,864 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 21:12:22,868 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 21:12:22,868 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 21:12:22,868 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 21:12:22,881 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:12:22" (1/1) ... [2019-12-27 21:12:22,881 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:12:22" (1/1) ... [2019-12-27 21:12:22,886 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:12:22" (1/1) ... [2019-12-27 21:12:22,886 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:12:22" (1/1) ... [2019-12-27 21:12:22,896 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:12:22" (1/1) ... [2019-12-27 21:12:22,899 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:12:22" (1/1) ... [2019-12-27 21:12:22,903 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:12:22" (1/1) ... [2019-12-27 21:12:22,907 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 21:12:22,908 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 21:12:22,908 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 21:12:22,908 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 21:12:22,909 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:12:22" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 21:12:22,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 21:12:22,969 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 21:12:22,969 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 21:12:22,969 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 21:12:22,969 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 21:12:22,969 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 21:12:22,970 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 21:12:22,970 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 21:12:22,970 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 21:12:22,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 21:12:22,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 21:12:22,972 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 21:12:23,742 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 21:12:23,743 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 21:12:23,744 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:12:23 BoogieIcfgContainer [2019-12-27 21:12:23,744 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 21:12:23,746 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 21:12:23,746 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 21:12:23,749 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 21:12:23,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 09:12:22" (1/3) ... [2019-12-27 21:12:23,750 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c6e069d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:12:23, skipping insertion in model container [2019-12-27 21:12:23,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:12:22" (2/3) ... [2019-12-27 21:12:23,751 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c6e069d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:12:23, skipping insertion in model container [2019-12-27 21:12:23,751 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:12:23" (3/3) ... [2019-12-27 21:12:23,753 INFO L109 eAbstractionObserver]: Analyzing ICFG mix041_pso.opt.i [2019-12-27 21:12:23,763 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 21:12:23,764 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 21:12:23,771 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 21:12:23,772 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 21:12:23,811 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:23,811 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:23,811 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:23,812 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:23,812 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:23,813 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:23,813 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:23,813 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:23,814 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:23,814 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:23,814 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:23,815 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:23,815 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:23,815 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:23,815 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:23,816 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:23,816 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:23,816 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:23,816 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:23,817 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:23,817 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:23,818 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:23,818 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:23,818 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:23,819 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:23,819 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:23,819 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:23,819 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:23,820 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:23,820 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:23,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:23,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:23,822 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:23,822 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:23,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:23,822 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:23,824 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:23,824 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:23,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:23,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:23,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:23,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:23,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:23,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:23,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:23,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:23,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:23,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:23,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:23,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:23,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:23,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:23,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:23,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:23,837 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:23,837 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:23,837 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:23,837 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:23,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:23,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:23,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:23,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:23,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:23,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:23,843 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:23,844 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:23,844 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:23,845 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:23,845 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:23,845 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:23,845 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:23,846 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:23,846 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:23,846 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:23,850 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:23,851 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:23,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:23,851 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:23,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:23,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:23,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:23,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:23,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:23,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:23,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:23,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:23,869 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 21:12:23,884 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 21:12:23,885 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 21:12:23,885 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 21:12:23,885 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 21:12:23,885 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 21:12:23,886 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 21:12:23,886 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 21:12:23,886 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 21:12:23,903 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 182 transitions [2019-12-27 21:12:23,906 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-27 21:12:24,010 INFO L132 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-27 21:12:24,011 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:12:24,025 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 256 event pairs. 0/137 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 21:12:24,043 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-27 21:12:24,086 INFO L132 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-27 21:12:24,086 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:12:24,092 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 256 event pairs. 0/137 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 21:12:24,104 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10378 [2019-12-27 21:12:24,105 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 21:12:27,009 WARN L192 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-27 21:12:27,128 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-27 21:12:27,149 INFO L206 etLargeBlockEncoding]: Checked pairs total: 48474 [2019-12-27 21:12:27,149 INFO L214 etLargeBlockEncoding]: Total number of compositions: 98 [2019-12-27 21:12:27,152 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 80 places, 92 transitions [2019-12-27 21:12:27,627 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 9180 states. [2019-12-27 21:12:27,629 INFO L276 IsEmpty]: Start isEmpty. Operand 9180 states. [2019-12-27 21:12:27,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 21:12:27,636 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:12:27,636 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 21:12:27,637 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:12:27,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:12:27,643 INFO L82 PathProgramCache]: Analyzing trace with hash 695759593, now seen corresponding path program 1 times [2019-12-27 21:12:27,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:12:27,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244660722] [2019-12-27 21:12:27,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:12:27,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:12:27,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:12:27,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244660722] [2019-12-27 21:12:27,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:12:27,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 21:12:27,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1734739040] [2019-12-27 21:12:27,880 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:12:27,885 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:12:27,899 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 21:12:27,899 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:12:27,903 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:12:27,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:12:27,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:12:27,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:12:27,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:12:27,922 INFO L87 Difference]: Start difference. First operand 9180 states. Second operand 3 states. [2019-12-27 21:12:28,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:12:28,250 INFO L93 Difference]: Finished difference Result 9090 states and 29695 transitions. [2019-12-27 21:12:28,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:12:28,252 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 21:12:28,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:12:28,359 INFO L225 Difference]: With dead ends: 9090 [2019-12-27 21:12:28,359 INFO L226 Difference]: Without dead ends: 8908 [2019-12-27 21:12:28,361 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:12:28,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8908 states. [2019-12-27 21:12:28,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8908 to 8908. [2019-12-27 21:12:28,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8908 states. [2019-12-27 21:12:28,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8908 states to 8908 states and 29136 transitions. [2019-12-27 21:12:28,794 INFO L78 Accepts]: Start accepts. Automaton has 8908 states and 29136 transitions. Word has length 5 [2019-12-27 21:12:28,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:12:28,794 INFO L462 AbstractCegarLoop]: Abstraction has 8908 states and 29136 transitions. [2019-12-27 21:12:28,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:12:28,795 INFO L276 IsEmpty]: Start isEmpty. Operand 8908 states and 29136 transitions. [2019-12-27 21:12:28,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 21:12:28,797 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:12:28,798 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:12:28,798 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:12:28,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:12:28,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1035576107, now seen corresponding path program 1 times [2019-12-27 21:12:28,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:12:28,799 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103829483] [2019-12-27 21:12:28,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:12:28,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:12:29,138 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 5 [2019-12-27 21:12:29,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:12:29,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103829483] [2019-12-27 21:12:29,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:12:29,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:12:29,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1322347819] [2019-12-27 21:12:29,141 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:12:29,143 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:12:29,147 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 35 transitions. [2019-12-27 21:12:29,148 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:12:29,200 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:12:29,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:12:29,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:12:29,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:12:29,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:12:29,202 INFO L87 Difference]: Start difference. First operand 8908 states and 29136 transitions. Second operand 5 states. [2019-12-27 21:12:29,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:12:29,671 INFO L93 Difference]: Finished difference Result 14155 states and 44019 transitions. [2019-12-27 21:12:29,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:12:29,672 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-12-27 21:12:29,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:12:29,754 INFO L225 Difference]: With dead ends: 14155 [2019-12-27 21:12:29,754 INFO L226 Difference]: Without dead ends: 14148 [2019-12-27 21:12:29,755 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:12:29,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14148 states. [2019-12-27 21:12:30,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14148 to 12754. [2019-12-27 21:12:30,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12754 states. [2019-12-27 21:12:30,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12754 states to 12754 states and 40283 transitions. [2019-12-27 21:12:30,447 INFO L78 Accepts]: Start accepts. Automaton has 12754 states and 40283 transitions. Word has length 11 [2019-12-27 21:12:30,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:12:30,447 INFO L462 AbstractCegarLoop]: Abstraction has 12754 states and 40283 transitions. [2019-12-27 21:12:30,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:12:30,448 INFO L276 IsEmpty]: Start isEmpty. Operand 12754 states and 40283 transitions. [2019-12-27 21:12:30,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 21:12:30,455 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:12:30,455 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:12:30,456 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:12:30,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:12:30,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1185448960, now seen corresponding path program 1 times [2019-12-27 21:12:30,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:12:30,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392904358] [2019-12-27 21:12:30,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:12:30,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:12:30,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:12:30,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392904358] [2019-12-27 21:12:30,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:12:30,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:12:30,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [951493545] [2019-12-27 21:12:30,602 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:12:30,603 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:12:30,605 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 21:12:30,605 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:12:30,605 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:12:30,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:12:30,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:12:30,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:12:30,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:12:30,607 INFO L87 Difference]: Start difference. First operand 12754 states and 40283 transitions. Second operand 4 states. [2019-12-27 21:12:30,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:12:30,869 INFO L93 Difference]: Finished difference Result 15365 states and 48133 transitions. [2019-12-27 21:12:30,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:12:30,870 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 21:12:30,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:12:30,920 INFO L225 Difference]: With dead ends: 15365 [2019-12-27 21:12:30,921 INFO L226 Difference]: Without dead ends: 15365 [2019-12-27 21:12:30,925 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:12:31,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15365 states. [2019-12-27 21:12:32,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15365 to 13687. [2019-12-27 21:12:32,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13687 states. [2019-12-27 21:12:32,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13687 states to 13687 states and 43249 transitions. [2019-12-27 21:12:32,164 INFO L78 Accepts]: Start accepts. Automaton has 13687 states and 43249 transitions. Word has length 11 [2019-12-27 21:12:32,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:12:32,164 INFO L462 AbstractCegarLoop]: Abstraction has 13687 states and 43249 transitions. [2019-12-27 21:12:32,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:12:32,164 INFO L276 IsEmpty]: Start isEmpty. Operand 13687 states and 43249 transitions. [2019-12-27 21:12:32,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 21:12:32,168 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:12:32,169 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:12:32,169 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:12:32,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:12:32,169 INFO L82 PathProgramCache]: Analyzing trace with hash 832654764, now seen corresponding path program 1 times [2019-12-27 21:12:32,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:12:32,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303564] [2019-12-27 21:12:32,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:12:32,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:12:32,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:12:32,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303564] [2019-12-27 21:12:32,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:12:32,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:12:32,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1868304821] [2019-12-27 21:12:32,271 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:12:32,277 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:12:32,282 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 42 states and 65 transitions. [2019-12-27 21:12:32,282 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:12:32,418 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 21:12:32,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 21:12:32,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:12:32,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 21:12:32,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:12:32,422 INFO L87 Difference]: Start difference. First operand 13687 states and 43249 transitions. Second operand 8 states. [2019-12-27 21:12:33,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:12:33,614 INFO L93 Difference]: Finished difference Result 18987 states and 58431 transitions. [2019-12-27 21:12:33,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 21:12:33,615 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2019-12-27 21:12:33,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:12:33,685 INFO L225 Difference]: With dead ends: 18987 [2019-12-27 21:12:33,685 INFO L226 Difference]: Without dead ends: 18980 [2019-12-27 21:12:33,686 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2019-12-27 21:12:33,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18980 states. [2019-12-27 21:12:34,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18980 to 13597. [2019-12-27 21:12:34,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13597 states. [2019-12-27 21:12:34,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13597 states to 13597 states and 42837 transitions. [2019-12-27 21:12:34,141 INFO L78 Accepts]: Start accepts. Automaton has 13597 states and 42837 transitions. Word has length 17 [2019-12-27 21:12:34,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:12:34,142 INFO L462 AbstractCegarLoop]: Abstraction has 13597 states and 42837 transitions. [2019-12-27 21:12:34,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 21:12:34,142 INFO L276 IsEmpty]: Start isEmpty. Operand 13597 states and 42837 transitions. [2019-12-27 21:12:34,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 21:12:34,154 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:12:34,154 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:12:34,155 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:12:34,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:12:34,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1895943995, now seen corresponding path program 1 times [2019-12-27 21:12:34,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:12:34,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395570898] [2019-12-27 21:12:34,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:12:34,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:12:34,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:12:34,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395570898] [2019-12-27 21:12:34,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:12:34,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:12:34,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [781450857] [2019-12-27 21:12:34,337 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:12:34,342 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:12:34,347 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 21:12:34,348 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:12:34,348 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:12:34,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:12:34,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:12:34,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:12:34,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:12:34,349 INFO L87 Difference]: Start difference. First operand 13597 states and 42837 transitions. Second operand 4 states. [2019-12-27 21:12:34,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:12:34,382 INFO L93 Difference]: Finished difference Result 2211 states and 5053 transitions. [2019-12-27 21:12:34,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:12:34,383 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 21:12:34,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:12:34,388 INFO L225 Difference]: With dead ends: 2211 [2019-12-27 21:12:34,388 INFO L226 Difference]: Without dead ends: 1925 [2019-12-27 21:12:34,389 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:12:34,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1925 states. [2019-12-27 21:12:34,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1925 to 1925. [2019-12-27 21:12:34,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1925 states. [2019-12-27 21:12:34,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1925 states to 1925 states and 4262 transitions. [2019-12-27 21:12:34,421 INFO L78 Accepts]: Start accepts. Automaton has 1925 states and 4262 transitions. Word has length 25 [2019-12-27 21:12:34,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:12:34,422 INFO L462 AbstractCegarLoop]: Abstraction has 1925 states and 4262 transitions. [2019-12-27 21:12:34,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:12:34,422 INFO L276 IsEmpty]: Start isEmpty. Operand 1925 states and 4262 transitions. [2019-12-27 21:12:34,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 21:12:34,426 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:12:34,426 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:12:34,426 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:12:34,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:12:34,427 INFO L82 PathProgramCache]: Analyzing trace with hash 228789501, now seen corresponding path program 1 times [2019-12-27 21:12:34,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:12:34,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773260443] [2019-12-27 21:12:34,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:12:34,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:12:34,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:12:34,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773260443] [2019-12-27 21:12:34,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:12:34,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:12:34,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1243652732] [2019-12-27 21:12:34,528 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:12:34,540 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:12:34,561 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 62 states and 85 transitions. [2019-12-27 21:12:34,561 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:12:34,580 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:12:34,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:12:34,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:12:34,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:12:34,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:12:34,581 INFO L87 Difference]: Start difference. First operand 1925 states and 4262 transitions. Second operand 6 states. [2019-12-27 21:12:34,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:12:34,625 INFO L93 Difference]: Finished difference Result 421 states and 770 transitions. [2019-12-27 21:12:34,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:12:34,626 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2019-12-27 21:12:34,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:12:34,628 INFO L225 Difference]: With dead ends: 421 [2019-12-27 21:12:34,628 INFO L226 Difference]: Without dead ends: 375 [2019-12-27 21:12:34,629 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:12:34,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2019-12-27 21:12:34,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 340. [2019-12-27 21:12:34,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-12-27 21:12:34,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 615 transitions. [2019-12-27 21:12:34,636 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 615 transitions. Word has length 37 [2019-12-27 21:12:34,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:12:34,637 INFO L462 AbstractCegarLoop]: Abstraction has 340 states and 615 transitions. [2019-12-27 21:12:34,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:12:34,637 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 615 transitions. [2019-12-27 21:12:34,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 21:12:34,639 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:12:34,639 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:12:34,639 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:12:34,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:12:34,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1711535056, now seen corresponding path program 1 times [2019-12-27 21:12:34,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:12:34,642 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311227551] [2019-12-27 21:12:34,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:12:34,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:12:34,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:12:34,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311227551] [2019-12-27 21:12:34,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:12:34,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:12:34,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [327462990] [2019-12-27 21:12:34,735 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:12:34,756 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:12:34,807 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 83 states and 112 transitions. [2019-12-27 21:12:34,807 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:12:34,809 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:12:34,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:12:34,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:12:34,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:12:34,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:12:34,811 INFO L87 Difference]: Start difference. First operand 340 states and 615 transitions. Second operand 3 states. [2019-12-27 21:12:34,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:12:34,852 INFO L93 Difference]: Finished difference Result 354 states and 634 transitions. [2019-12-27 21:12:34,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:12:34,853 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 21:12:34,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:12:34,854 INFO L225 Difference]: With dead ends: 354 [2019-12-27 21:12:34,854 INFO L226 Difference]: Without dead ends: 354 [2019-12-27 21:12:34,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:12:34,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-12-27 21:12:34,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 350. [2019-12-27 21:12:34,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2019-12-27 21:12:34,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 630 transitions. [2019-12-27 21:12:34,861 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 630 transitions. Word has length 52 [2019-12-27 21:12:34,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:12:34,864 INFO L462 AbstractCegarLoop]: Abstraction has 350 states and 630 transitions. [2019-12-27 21:12:34,864 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:12:34,864 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 630 transitions. [2019-12-27 21:12:34,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 21:12:34,867 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:12:34,867 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:12:34,867 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:12:34,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:12:34,867 INFO L82 PathProgramCache]: Analyzing trace with hash 2008413200, now seen corresponding path program 1 times [2019-12-27 21:12:34,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:12:34,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122402908] [2019-12-27 21:12:34,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:12:34,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:12:34,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:12:34,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122402908] [2019-12-27 21:12:34,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:12:34,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:12:34,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1568804094] [2019-12-27 21:12:34,949 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:12:34,964 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:12:35,000 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 83 states and 112 transitions. [2019-12-27 21:12:35,000 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:12:35,001 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:12:35,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:12:35,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:12:35,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:12:35,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:12:35,002 INFO L87 Difference]: Start difference. First operand 350 states and 630 transitions. Second operand 3 states. [2019-12-27 21:12:35,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:12:35,013 INFO L93 Difference]: Finished difference Result 350 states and 617 transitions. [2019-12-27 21:12:35,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:12:35,016 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 21:12:35,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:12:35,017 INFO L225 Difference]: With dead ends: 350 [2019-12-27 21:12:35,017 INFO L226 Difference]: Without dead ends: 350 [2019-12-27 21:12:35,017 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:12:35,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2019-12-27 21:12:35,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 350. [2019-12-27 21:12:35,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2019-12-27 21:12:35,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 617 transitions. [2019-12-27 21:12:35,022 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 617 transitions. Word has length 52 [2019-12-27 21:12:35,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:12:35,022 INFO L462 AbstractCegarLoop]: Abstraction has 350 states and 617 transitions. [2019-12-27 21:12:35,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:12:35,022 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 617 transitions. [2019-12-27 21:12:35,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 21:12:35,024 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:12:35,024 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-27 21:12:35,024 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:12:35,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:12:35,024 INFO L82 PathProgramCache]: Analyzing trace with hash -440282734, now seen corresponding path program 1 times [2019-12-27 21:12:35,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:12:35,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564661301] [2019-12-27 21:12:35,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:12:35,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:12:35,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:12:35,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564661301] [2019-12-27 21:12:35,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:12:35,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 21:12:35,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1562608289] [2019-12-27 21:12:35,219 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:12:35,301 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:12:35,342 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 87 states and 119 transitions. [2019-12-27 21:12:35,342 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:12:35,447 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 21:12:35,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 21:12:35,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:12:35,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 21:12:35,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-12-27 21:12:35,448 INFO L87 Difference]: Start difference. First operand 350 states and 617 transitions. Second operand 10 states. [2019-12-27 21:12:36,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:12:36,091 INFO L93 Difference]: Finished difference Result 564 states and 980 transitions. [2019-12-27 21:12:36,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 21:12:36,091 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 53 [2019-12-27 21:12:36,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:12:36,093 INFO L225 Difference]: With dead ends: 564 [2019-12-27 21:12:36,094 INFO L226 Difference]: Without dead ends: 564 [2019-12-27 21:12:36,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 10 SyntacticMatches, 6 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2019-12-27 21:12:36,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2019-12-27 21:12:36,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 435. [2019-12-27 21:12:36,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2019-12-27 21:12:36,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 766 transitions. [2019-12-27 21:12:36,103 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 766 transitions. Word has length 53 [2019-12-27 21:12:36,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:12:36,104 INFO L462 AbstractCegarLoop]: Abstraction has 435 states and 766 transitions. [2019-12-27 21:12:36,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 21:12:36,104 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 766 transitions. [2019-12-27 21:12:36,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 21:12:36,106 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:12:36,106 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-27 21:12:36,106 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:12:36,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:12:36,107 INFO L82 PathProgramCache]: Analyzing trace with hash 783878168, now seen corresponding path program 2 times [2019-12-27 21:12:36,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:12:36,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435016785] [2019-12-27 21:12:36,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:12:36,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:12:36,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:12:36,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435016785] [2019-12-27 21:12:36,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:12:36,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:12:36,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1668379138] [2019-12-27 21:12:36,193 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:12:36,213 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:12:36,257 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 78 states and 100 transitions. [2019-12-27 21:12:36,258 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:12:36,259 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:12:36,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:12:36,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:12:36,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:12:36,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:12:36,261 INFO L87 Difference]: Start difference. First operand 435 states and 766 transitions. Second operand 3 states. [2019-12-27 21:12:36,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:12:36,314 INFO L93 Difference]: Finished difference Result 434 states and 764 transitions. [2019-12-27 21:12:36,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:12:36,315 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-27 21:12:36,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:12:36,316 INFO L225 Difference]: With dead ends: 434 [2019-12-27 21:12:36,316 INFO L226 Difference]: Without dead ends: 434 [2019-12-27 21:12:36,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:12:36,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2019-12-27 21:12:36,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 349. [2019-12-27 21:12:36,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2019-12-27 21:12:36,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 606 transitions. [2019-12-27 21:12:36,323 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 606 transitions. Word has length 53 [2019-12-27 21:12:36,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:12:36,325 INFO L462 AbstractCegarLoop]: Abstraction has 349 states and 606 transitions. [2019-12-27 21:12:36,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:12:36,325 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 606 transitions. [2019-12-27 21:12:36,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 21:12:36,328 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:12:36,328 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:12:36,328 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:12:36,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:12:36,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1094441083, now seen corresponding path program 1 times [2019-12-27 21:12:36,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:12:36,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430080302] [2019-12-27 21:12:36,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:12:36,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:12:36,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:12:36,569 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430080302] [2019-12-27 21:12:36,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:12:36,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 21:12:36,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1492673299] [2019-12-27 21:12:36,570 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:12:36,587 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:12:36,747 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 88 states and 119 transitions. [2019-12-27 21:12:36,747 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:12:36,748 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:12:36,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 21:12:36,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:12:36,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 21:12:36,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-27 21:12:36,749 INFO L87 Difference]: Start difference. First operand 349 states and 606 transitions. Second operand 9 states. [2019-12-27 21:12:37,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:12:37,020 INFO L93 Difference]: Finished difference Result 554 states and 966 transitions. [2019-12-27 21:12:37,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 21:12:37,020 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-12-27 21:12:37,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:12:37,021 INFO L225 Difference]: With dead ends: 554 [2019-12-27 21:12:37,021 INFO L226 Difference]: Without dead ends: 222 [2019-12-27 21:12:37,022 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2019-12-27 21:12:37,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-12-27 21:12:37,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 198. [2019-12-27 21:12:37,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-12-27 21:12:37,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 341 transitions. [2019-12-27 21:12:37,025 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 341 transitions. Word has length 54 [2019-12-27 21:12:37,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:12:37,026 INFO L462 AbstractCegarLoop]: Abstraction has 198 states and 341 transitions. [2019-12-27 21:12:37,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 21:12:37,026 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 341 transitions. [2019-12-27 21:12:37,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 21:12:37,028 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:12:37,028 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:12:37,028 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:12:37,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:12:37,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1606647941, now seen corresponding path program 2 times [2019-12-27 21:12:37,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:12:37,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716911452] [2019-12-27 21:12:37,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:12:37,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:12:37,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:12:37,210 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 21:12:37,210 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 21:12:37,214 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] ULTIMATE.startENTRY-->L789: Formula: (let ((.cse0 (store |v_#valid_44| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= v_~x$r_buff1_thd1~0_19 0) (= 0 v_~x$read_delayed_var~0.offset_6) (= v_~x$r_buff1_thd2~0_17 0) (= v_~x$w_buff1_used~0_63 0) (= 0 v_~x$r_buff0_thd2~0_26) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1095~0.base_20| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1095~0.base_20|) |v_ULTIMATE.start_main_~#t1095~0.offset_15| 0)) |v_#memory_int_17|) (= 0 v_~__unbuffered_cnt~0_15) (= 0 v_~x$w_buff1~0_23) (= 0 v_~x$r_buff0_thd1~0_20) (= v_~x~0_28 0) (= |v_ULTIMATE.start_main_~#t1095~0.offset_15| 0) (= v_~x$flush_delayed~0_16 0) (= 0 v_~x$r_buff0_thd0~0_78) (= (store .cse0 |v_ULTIMATE.start_main_~#t1095~0.base_20| 1) |v_#valid_42|) (= 0 v_~__unbuffered_p1_EAX~0_10) (= 0 v_~x$read_delayed~0_6) (< 0 |v_#StackHeapBarrier_14|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1095~0.base_20|)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t1095~0.base_20| 4) |v_#length_17|) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1095~0.base_20|) (= |v_#NULL.offset_5| 0) (= 0 v_~y~0_8) (= 0 v_~x$w_buff0_used~0_105) (= 0 v_~z~0_9) (= v_~x$mem_tmp~0_11 0) (= v_~x$r_buff1_thd0~0_45 0) (= 0 v_~weak$$choice0~0_6) (= v_~main$tmp_guard0~0_11 0) (= v_~main$tmp_guard1~0_12 0) (= 0 v_~weak$$choice2~0_31) (= 0 |v_#NULL.base_5|) (= v_~__unbuffered_p1_EBX~0_10 0) (= 0 v_~x$w_buff0~0_28))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_28, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_15|, ~x$flush_delayed~0=v_~x$flush_delayed~0_16, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_12|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_19, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_10|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_15|, ULTIMATE.start_main_~#t1096~0.offset=|v_ULTIMATE.start_main_~#t1096~0.offset_14|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_15|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ULTIMATE.start_main_~#t1096~0.base=|v_ULTIMATE.start_main_~#t1096~0.base_17|, #length=|v_#length_17|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_78, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_13|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_14|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_8|, ~x$w_buff1~0=v_~x$w_buff1~0_23, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_12|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_63, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_17, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_15|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_14|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_13|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_6, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_16|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~x~0=v_~x~0_28, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_20, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_12|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_12|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_13|, ~x$mem_tmp~0=v_~x$mem_tmp~0_11, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_12|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_12|, ULTIMATE.start_main_~#t1095~0.offset=|v_ULTIMATE.start_main_~#t1095~0.offset_15|, ~y~0=v_~y~0_8, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_10, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_12|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_8|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_10|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_13|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_15|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_45, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_26, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_14|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_15|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_105, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_14|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_7|, ~z~0=v_~z~0_9, ~weak$$choice2~0=v_~weak$$choice2~0_31, ULTIMATE.start_main_~#t1095~0.base=|v_ULTIMATE.start_main_~#t1095~0.base_20|, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~ite28, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite26, ~x$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_~#t1096~0.offset, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t1096~0.base, #length, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~nondet15, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_~#t1095~0.offset, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~z~0, ~weak$$choice2~0, ULTIMATE.start_main_~#t1095~0.base, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 21:12:37,215 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L789-1-->L791: Formula: (and (= (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1096~0.base_11|) 0) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1096~0.base_11| 4)) (not (= |v_ULTIMATE.start_main_~#t1096~0.base_11| 0)) (= |v_ULTIMATE.start_main_~#t1096~0.offset_10| 0) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1096~0.base_11|) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1096~0.base_11| 1)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1096~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1096~0.base_11|) |v_ULTIMATE.start_main_~#t1096~0.offset_10| 1)) |v_#memory_int_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1096~0.base=|v_ULTIMATE.start_main_~#t1096~0.base_11|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_11|, ULTIMATE.start_main_~#t1096~0.offset=|v_ULTIMATE.start_main_~#t1096~0.offset_10|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t1096~0.base, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t1096~0.offset] because there is no mapped edge [2019-12-27 21:12:37,216 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [588] [588] P1ENTRY-->L4-3: Formula: (and (= v_~x$w_buff1_used~0_43 v_~x$w_buff0_used~0_72) (= (mod v_~x$w_buff1_used~0_43 256) 0) (= |v_P1Thread1of1ForFork1_#in~arg.offset_5| v_P1Thread1of1ForFork1_~arg.offset_5) (= v_P1Thread1of1ForFork1_~arg.base_5 |v_P1Thread1of1ForFork1_#in~arg.base_5|) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5| 1) (= 2 v_~x$w_buff0~0_15) (= v_~x$w_buff0~0_16 v_~x$w_buff1~0_13) (= 1 v_~x$w_buff0_used~0_71) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_16, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_72} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7, ~x$w_buff0~0=v_~x$w_buff0~0_15, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_5, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_5, ~x$w_buff1~0=v_~x$w_buff1~0_13, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_43, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_71} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-27 21:12:37,219 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L732-2-->L732-5: Formula: (let ((.cse0 (= |P0Thread1of1ForFork0_#t~ite3_Out1273170530| |P0Thread1of1ForFork0_#t~ite4_Out1273170530|)) (.cse1 (= (mod ~x$r_buff1_thd1~0_In1273170530 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In1273170530 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite3_Out1273170530| ~x$w_buff1~0_In1273170530) .cse0 (not .cse1) (not .cse2)) (and (= ~x~0_In1273170530 |P0Thread1of1ForFork0_#t~ite3_Out1273170530|) .cse0 (or .cse1 .cse2)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1273170530, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1273170530, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1273170530, ~x~0=~x~0_In1273170530} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out1273170530|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out1273170530|, ~x$w_buff1~0=~x$w_buff1~0_In1273170530, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1273170530, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1273170530, ~x~0=~x~0_In1273170530} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-27 21:12:37,220 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [653] [653] L733-->L733-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In1916087436 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In1916087436 256) 0))) (or (and (= ~x$w_buff0_used~0_In1916087436 |P0Thread1of1ForFork0_#t~ite5_Out1916087436|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out1916087436| 0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1916087436, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1916087436} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1916087436|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1916087436, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1916087436} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 21:12:37,221 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L734-->L734-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff0_used~0_In-2130756519 256))) (.cse2 (= (mod ~x$r_buff0_thd1~0_In-2130756519 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-2130756519 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-2130756519 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In-2130756519 |P0Thread1of1ForFork0_#t~ite6_Out-2130756519|)) (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-2130756519|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-2130756519, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2130756519, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-2130756519, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2130756519} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-2130756519|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-2130756519, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2130756519, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-2130756519, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2130756519} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 21:12:37,221 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L735-->L735-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In1602406252 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd1~0_In1602406252 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite7_Out1602406252| ~x$r_buff0_thd1~0_In1602406252) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite7_Out1602406252| 0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1602406252, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1602406252} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1602406252, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1602406252|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1602406252} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-27 21:12:37,222 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L736-->L736-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-1413586776 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-1413586776 256))) (.cse2 (= (mod ~x$r_buff1_thd1~0_In-1413586776 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In-1413586776 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out-1413586776| ~x$r_buff1_thd1~0_In-1413586776) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite8_Out-1413586776| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1413586776, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1413586776, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1413586776, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1413586776} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1413586776, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1413586776|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1413586776, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1413586776, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1413586776} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 21:12:37,222 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L736-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_15 |v_P0Thread1of1ForFork0_#t~ite8_8|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1))) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_15} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-27 21:12:37,223 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [646] [646] L767-->L767-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In1471937779 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1471937779 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite11_Out1471937779| ~x$w_buff0_used~0_In1471937779) (or .cse0 .cse1)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out1471937779| 0) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1471937779, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1471937779} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out1471937779|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1471937779, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1471937779} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 21:12:37,223 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [649] [649] L768-->L768-2: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In-6161752 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In-6161752 256))) (.cse2 (= (mod ~x$r_buff0_thd2~0_In-6161752 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-6161752 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite12_Out-6161752|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$w_buff1_used~0_In-6161752 |P1Thread1of1ForFork1_#t~ite12_Out-6161752|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-6161752, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-6161752, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-6161752, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-6161752} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-6161752, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-6161752, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-6161752|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-6161752, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-6161752} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 21:12:37,224 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L769-->L770: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In1722010204 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1722010204 256)))) (or (and (not .cse0) (not .cse1) (= ~x$r_buff0_thd2~0_Out1722010204 0)) (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_Out1722010204 ~x$r_buff0_thd2~0_In1722010204)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1722010204, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1722010204} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out1722010204|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1722010204, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1722010204} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 21:12:37,224 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [665] [665] L770-->L770-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In1769450297 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In1769450297 256))) (.cse3 (= (mod ~x$r_buff1_thd2~0_In1769450297 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In1769450297 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite14_Out1769450297| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |P1Thread1of1ForFork1_#t~ite14_Out1769450297| ~x$r_buff1_thd2~0_In1769450297)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1769450297, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1769450297, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1769450297, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1769450297} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1769450297, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1769450297, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1769450297, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1769450297|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1769450297} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 21:12:37,224 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L770-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_13 |v_P1Thread1of1ForFork1_#t~ite14_8|) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_13, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_7|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 21:12:37,225 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [636] [636] L795-->L797-2: Formula: (and (or (= 0 (mod v_~x$w_buff0_used~0_93 256)) (= 0 (mod v_~x$r_buff0_thd0~0_66 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_66, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_93} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_66, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_93} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 21:12:37,225 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [655] [655] L797-2-->L797-4: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In-171644355 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd0~0_In-171644355 256) 0))) (or (and (= ~x~0_In-171644355 |ULTIMATE.start_main_#t~ite17_Out-171644355|) (or .cse0 .cse1)) (and (not .cse1) (= ~x$w_buff1~0_In-171644355 |ULTIMATE.start_main_#t~ite17_Out-171644355|) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-171644355, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-171644355, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-171644355, ~x~0=~x~0_In-171644355} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out-171644355|, ~x$w_buff1~0=~x$w_buff1~0_In-171644355, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-171644355, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-171644355, ~x~0=~x~0_In-171644355} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17] because there is no mapped edge [2019-12-27 21:12:37,225 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [618] [618] L797-4-->L798: Formula: (= v_~x~0_19 |v_ULTIMATE.start_main_#t~ite17_8|) InVars {ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_8|} OutVars{ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_7|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_7|, ~x~0=v_~x~0_19} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ~x~0] because there is no mapped edge [2019-12-27 21:12:37,225 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [664] [664] L798-->L798-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In1992655253 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1992655253 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite19_Out1992655253|) (not .cse1)) (and (= ~x$w_buff0_used~0_In1992655253 |ULTIMATE.start_main_#t~ite19_Out1992655253|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1992655253, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1992655253} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1992655253, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out1992655253|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1992655253} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-27 21:12:37,226 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L799-->L799-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In1885409057 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In1885409057 256))) (.cse2 (= (mod ~x$r_buff0_thd0~0_In1885409057 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In1885409057 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite20_Out1885409057| 0)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite20_Out1885409057| ~x$w_buff1_used~0_In1885409057) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1885409057, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1885409057, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1885409057, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1885409057} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1885409057, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1885409057, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out1885409057|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1885409057, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1885409057} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 21:12:37,227 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L800-->L800-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In835978214 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd0~0_In835978214 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite21_Out835978214|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite21_Out835978214| ~x$r_buff0_thd0~0_In835978214)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In835978214, ~x$w_buff0_used~0=~x$w_buff0_used~0_In835978214} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In835978214, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out835978214|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In835978214} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 21:12:37,227 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L801-->L801-2: Formula: (let ((.cse3 (= (mod ~x$r_buff0_thd0~0_In-1440059728 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-1440059728 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-1440059728 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In-1440059728 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite22_Out-1440059728| ~x$r_buff1_thd0~0_In-1440059728) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite22_Out-1440059728| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1440059728, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1440059728, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1440059728, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1440059728} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1440059728, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1440059728, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1440059728, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-1440059728|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1440059728} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 21:12:37,229 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L810-->L810-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1437876137 256) 0))) (or (and (= ~x$w_buff1~0_In-1437876137 |ULTIMATE.start_main_#t~ite32_Out-1437876137|) (= |ULTIMATE.start_main_#t~ite31_In-1437876137| |ULTIMATE.start_main_#t~ite31_Out-1437876137|) (not .cse0)) (and (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-1437876137 256)))) (or (= (mod ~x$w_buff0_used~0_In-1437876137 256) 0) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In-1437876137 256))) (and (= (mod ~x$r_buff1_thd0~0_In-1437876137 256) 0) .cse1))) (= ~x$w_buff1~0_In-1437876137 |ULTIMATE.start_main_#t~ite31_Out-1437876137|) .cse0 (= |ULTIMATE.start_main_#t~ite32_Out-1437876137| |ULTIMATE.start_main_#t~ite31_Out-1437876137|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1437876137, ~x$w_buff1~0=~x$w_buff1~0_In-1437876137, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1437876137, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1437876137, ~weak$$choice2~0=~weak$$choice2~0_In-1437876137, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_In-1437876137|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1437876137} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1437876137, ~x$w_buff1~0=~x$w_buff1~0_In-1437876137, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1437876137, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out-1437876137|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1437876137, ~weak$$choice2~0=~weak$$choice2~0_In-1437876137, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_Out-1437876137|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1437876137} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite32] because there is no mapped edge [2019-12-27 21:12:37,231 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L812-->L812-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1924432709 256)))) (or (and .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-1924432709 256)))) (or (and (= 0 (mod ~x$r_buff1_thd0~0_In-1924432709 256)) .cse1) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In-1924432709 256))) (= 0 (mod ~x$w_buff0_used~0_In-1924432709 256)))) (= |ULTIMATE.start_main_#t~ite37_Out-1924432709| ~x$w_buff1_used~0_In-1924432709) (= |ULTIMATE.start_main_#t~ite37_Out-1924432709| |ULTIMATE.start_main_#t~ite38_Out-1924432709|)) (and (= |ULTIMATE.start_main_#t~ite37_In-1924432709| |ULTIMATE.start_main_#t~ite37_Out-1924432709|) (= ~x$w_buff1_used~0_In-1924432709 |ULTIMATE.start_main_#t~ite38_Out-1924432709|) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1924432709, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1924432709, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_In-1924432709|, ~weak$$choice2~0=~weak$$choice2~0_In-1924432709, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1924432709, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1924432709} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1924432709, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1924432709, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1924432709|, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-1924432709|, ~weak$$choice2~0=~weak$$choice2~0_In-1924432709, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1924432709, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1924432709} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-27 21:12:37,232 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [602] [602] L813-->L814: Formula: (and (not (= (mod v_~weak$$choice2~0_18 256) 0)) (= v_~x$r_buff0_thd0~0_53 v_~x$r_buff0_thd0~0_52)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_53, ~weak$$choice2~0=v_~weak$$choice2~0_18} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_52, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_6|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_6|, ~weak$$choice2~0=v_~weak$$choice2~0_18} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 21:12:37,233 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L816-->L819-1: Formula: (and (not (= 0 (mod v_~x$flush_delayed~0_11 256))) (= v_~x$mem_tmp~0_6 v_~x~0_23) (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_~x$flush_delayed~0_10 0)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_11, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~x$mem_tmp~0=v_~x$mem_tmp~0_6} OutVars{~x$flush_delayed~0=v_~x$flush_delayed~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~x$mem_tmp~0=v_~x$mem_tmp~0_6, ~x~0=v_~x~0_23, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_11|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[~x$flush_delayed~0, ~x~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 21:12:37,233 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [670] [670] L819-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 21:12:37,330 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 09:12:37 BasicIcfg [2019-12-27 21:12:37,330 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 21:12:37,332 INFO L168 Benchmark]: Toolchain (without parser) took 15312.45 ms. Allocated memory was 137.9 MB in the beginning and 724.6 MB in the end (delta: 586.7 MB). Free memory was 100.7 MB in the beginning and 465.3 MB in the end (delta: -364.6 MB). Peak memory consumption was 222.1 MB. Max. memory is 7.1 GB. [2019-12-27 21:12:37,336 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 21:12:37,337 INFO L168 Benchmark]: CACSL2BoogieTranslator took 765.48 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 100.3 MB in the beginning and 156.3 MB in the end (delta: -56.0 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB. [2019-12-27 21:12:37,338 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.30 ms. Allocated memory is still 201.9 MB. Free memory was 156.3 MB in the beginning and 153.0 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-12-27 21:12:37,338 INFO L168 Benchmark]: Boogie Preprocessor took 39.80 ms. Allocated memory is still 201.9 MB. Free memory was 153.0 MB in the beginning and 150.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-27 21:12:37,342 INFO L168 Benchmark]: RCFGBuilder took 836.47 ms. Allocated memory is still 201.9 MB. Free memory was 150.9 MB in the beginning and 106.5 MB in the end (delta: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 7.1 GB. [2019-12-27 21:12:37,343 INFO L168 Benchmark]: TraceAbstraction took 13584.63 ms. Allocated memory was 201.9 MB in the beginning and 724.6 MB in the end (delta: 522.7 MB). Free memory was 105.9 MB in the beginning and 465.3 MB in the end (delta: -359.5 MB). Peak memory consumption was 163.3 MB. Max. memory is 7.1 GB. [2019-12-27 21:12:37,349 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 765.48 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 100.3 MB in the beginning and 156.3 MB in the end (delta: -56.0 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 77.30 ms. Allocated memory is still 201.9 MB. Free memory was 156.3 MB in the beginning and 153.0 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.80 ms. Allocated memory is still 201.9 MB. Free memory was 153.0 MB in the beginning and 150.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 836.47 ms. Allocated memory is still 201.9 MB. Free memory was 150.9 MB in the beginning and 106.5 MB in the end (delta: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13584.63 ms. Allocated memory was 201.9 MB in the beginning and 724.6 MB in the end (delta: 522.7 MB). Free memory was 105.9 MB in the beginning and 465.3 MB in the end (delta: -359.5 MB). Peak memory consumption was 163.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.2s, 148 ProgramPointsBefore, 80 ProgramPointsAfterwards, 182 TransitionsBefore, 92 TransitionsAfterwards, 10378 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 25 ChoiceCompositions, 3580 VarBasedMoverChecksPositive, 150 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 48474 CheckedPairsTotal, 98 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L789] FCALL, FORK 0 pthread_create(&t1095, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L791] FCALL, FORK 0 pthread_create(&t1096, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L751] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L752] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L753] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L754] 2 x$r_buff0_thd2 = (_Bool)1 [L757] 2 y = 1 [L760] 2 __unbuffered_p1_EAX = y [L763] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L726] 1 z = 1 [L729] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L732] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L732] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L766] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L733] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L734] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L735] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L766] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L767] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L768] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L793] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L798] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L799] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L800] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L801] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L804] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L805] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L806] 0 x$flush_delayed = weak$$choice2 [L807] 0 x$mem_tmp = x VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L808] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L808] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L809] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L809] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L810] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L811] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L811] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L812] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L814] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L814] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 13.3s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1202 SDtfs, 1388 SDslu, 2156 SDs, 0 SdLazy, 1555 SolverSat, 115 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 96 GetRequests, 23 SyntacticMatches, 11 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13687occurred 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: 2.8s AutomataMinimizationTime, 11 MinimizatonAttempts, 8732 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 424 NumberOfCodeBlocks, 424 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 359 ConstructedInterpolants, 0 QuantifiedInterpolants, 50725 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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...