/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe021_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 07:51:23,708 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 07:51:23,710 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 07:51:23,726 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 07:51:23,727 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 07:51:23,729 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 07:51:23,731 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 07:51:23,740 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 07:51:23,743 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 07:51:23,746 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 07:51:23,748 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 07:51:23,750 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 07:51:23,751 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 07:51:23,752 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 07:51:23,755 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 07:51:23,756 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 07:51:23,758 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 07:51:23,759 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 07:51:23,760 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 07:51:23,764 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 07:51:23,768 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 07:51:23,772 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 07:51:23,773 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 07:51:23,774 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 07:51:23,776 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 07:51:23,776 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 07:51:23,776 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 07:51:23,778 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 07:51:23,779 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 07:51:23,779 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 07:51:23,780 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 07:51:23,781 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 07:51:23,782 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 07:51:23,783 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 07:51:23,784 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 07:51:23,784 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 07:51:23,785 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 07:51:23,785 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 07:51:23,785 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 07:51:23,786 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 07:51:23,787 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 07:51:23,788 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-27 07:51:23,820 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 07:51:23,820 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 07:51:23,825 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 07:51:23,825 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 07:51:23,826 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 07:51:23,826 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 07:51:23,826 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 07:51:23,826 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 07:51:23,826 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 07:51:23,827 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 07:51:23,828 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 07:51:23,828 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 07:51:23,828 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 07:51:23,828 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 07:51:23,828 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 07:51:23,828 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 07:51:23,829 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 07:51:23,830 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 07:51:23,830 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 07:51:23,830 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 07:51:23,831 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 07:51:23,831 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 07:51:23,831 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 07:51:23,831 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 07:51:23,831 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 07:51:23,831 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 07:51:23,832 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 07:51:23,832 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 07:51:23,832 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 07:51:23,832 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 07:51:24,111 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 07:51:24,124 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 07:51:24,128 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 07:51:24,129 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 07:51:24,130 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 07:51:24,131 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe021_pso.opt.i [2019-12-27 07:51:24,206 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdb372c3f/ccb52c65150a4b1692960a0627bc38f6/FLAG401f3cfe8 [2019-12-27 07:51:24,771 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 07:51:24,772 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe021_pso.opt.i [2019-12-27 07:51:24,787 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdb372c3f/ccb52c65150a4b1692960a0627bc38f6/FLAG401f3cfe8 [2019-12-27 07:51:25,041 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdb372c3f/ccb52c65150a4b1692960a0627bc38f6 [2019-12-27 07:51:25,052 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 07:51:25,054 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 07:51:25,055 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 07:51:25,055 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 07:51:25,059 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 07:51:25,060 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:51:25" (1/1) ... [2019-12-27 07:51:25,063 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23abe169 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:51:25, skipping insertion in model container [2019-12-27 07:51:25,063 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:51:25" (1/1) ... [2019-12-27 07:51:25,072 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 07:51:25,142 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 07:51:25,711 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 07:51:25,729 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 07:51:25,807 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 07:51:25,883 INFO L208 MainTranslator]: Completed translation [2019-12-27 07:51:25,883 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:51:25 WrapperNode [2019-12-27 07:51:25,884 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 07:51:25,884 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 07:51:25,884 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 07:51:25,885 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 07:51:25,894 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:51:25" (1/1) ... [2019-12-27 07:51:25,915 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:51:25" (1/1) ... [2019-12-27 07:51:25,956 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 07:51:25,956 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 07:51:25,956 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 07:51:25,957 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 07:51:25,967 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:51:25" (1/1) ... [2019-12-27 07:51:25,967 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:51:25" (1/1) ... [2019-12-27 07:51:25,973 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:51:25" (1/1) ... [2019-12-27 07:51:25,973 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:51:25" (1/1) ... [2019-12-27 07:51:25,985 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:51:25" (1/1) ... [2019-12-27 07:51:25,990 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:51:25" (1/1) ... [2019-12-27 07:51:25,994 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:51:25" (1/1) ... [2019-12-27 07:51:25,999 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 07:51:26,000 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 07:51:26,000 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 07:51:26,000 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 07:51:26,001 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:51:25" (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 07:51:26,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 07:51:26,068 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 07:51:26,068 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 07:51:26,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 07:51:26,068 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 07:51:26,068 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 07:51:26,069 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 07:51:26,069 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 07:51:26,069 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 07:51:26,069 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 07:51:26,069 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 07:51:26,069 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 07:51:26,070 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 07:51:26,072 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 07:51:26,857 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 07:51:26,857 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 07:51:26,859 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:51:26 BoogieIcfgContainer [2019-12-27 07:51:26,859 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 07:51:26,860 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 07:51:26,860 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 07:51:26,864 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 07:51:26,864 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 07:51:25" (1/3) ... [2019-12-27 07:51:26,865 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ed689 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:51:26, skipping insertion in model container [2019-12-27 07:51:26,866 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:51:25" (2/3) ... [2019-12-27 07:51:26,866 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ed689 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:51:26, skipping insertion in model container [2019-12-27 07:51:26,866 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:51:26" (3/3) ... [2019-12-27 07:51:26,868 INFO L109 eAbstractionObserver]: Analyzing ICFG safe021_pso.opt.i [2019-12-27 07:51:26,879 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 07:51:26,879 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 07:51:26,890 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 07:51:26,891 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 07:51:26,929 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,929 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,930 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,930 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,943 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,943 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,943 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,944 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,945 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,980 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,980 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,993 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,999 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:26,999 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:27,002 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:27,002 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:27,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:27,010 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:27,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:27,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:27,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:27,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:27,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:27,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:27,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:27,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:27,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:27,015 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:27,015 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:27,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:27,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:27,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:27,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:27,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:27,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:27,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:27,031 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 07:51:27,047 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 07:51:27,047 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 07:51:27,047 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 07:51:27,048 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 07:51:27,048 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 07:51:27,048 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 07:51:27,048 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 07:51:27,048 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 07:51:27,065 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 212 transitions [2019-12-27 07:51:27,067 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-27 07:51:27,173 INFO L132 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-27 07:51:27,173 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 07:51:27,190 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 339 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 07:51:27,216 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-27 07:51:27,271 INFO L132 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-27 07:51:27,271 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 07:51:27,279 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 339 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 07:51:27,299 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17074 [2019-12-27 07:51:27,300 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 07:51:30,672 WARN L192 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 80 [2019-12-27 07:51:30,785 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-12-27 07:51:30,941 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 07:51:31,069 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 07:51:31,101 INFO L206 etLargeBlockEncoding]: Checked pairs total: 91912 [2019-12-27 07:51:31,102 INFO L214 etLargeBlockEncoding]: Total number of compositions: 111 [2019-12-27 07:51:31,106 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 101 transitions [2019-12-27 07:51:49,372 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 115110 states. [2019-12-27 07:51:49,373 INFO L276 IsEmpty]: Start isEmpty. Operand 115110 states. [2019-12-27 07:51:49,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 07:51:49,379 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:51:49,380 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 07:51:49,381 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:51:49,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:51:49,390 INFO L82 PathProgramCache]: Analyzing trace with hash 815308427, now seen corresponding path program 1 times [2019-12-27 07:51:49,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:51:49,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960712472] [2019-12-27 07:51:49,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:51:49,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:51:49,638 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 07:51:49,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960712472] [2019-12-27 07:51:49,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:51:49,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 07:51:49,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604457918] [2019-12-27 07:51:49,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:51:49,650 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:51:49,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:51:49,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:51:49,673 INFO L87 Difference]: Start difference. First operand 115110 states. Second operand 3 states. [2019-12-27 07:51:50,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:51:50,930 INFO L93 Difference]: Finished difference Result 114720 states and 487546 transitions. [2019-12-27 07:51:50,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:51:50,931 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 07:51:50,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:51:51,732 INFO L225 Difference]: With dead ends: 114720 [2019-12-27 07:51:51,734 INFO L226 Difference]: Without dead ends: 112172 [2019-12-27 07:51:51,735 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 07:51:58,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112172 states. [2019-12-27 07:52:03,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112172 to 112172. [2019-12-27 07:52:03,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112172 states. [2019-12-27 07:52:04,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112172 states to 112172 states and 477158 transitions. [2019-12-27 07:52:04,350 INFO L78 Accepts]: Start accepts. Automaton has 112172 states and 477158 transitions. Word has length 5 [2019-12-27 07:52:04,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:52:04,350 INFO L462 AbstractCegarLoop]: Abstraction has 112172 states and 477158 transitions. [2019-12-27 07:52:04,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:52:04,351 INFO L276 IsEmpty]: Start isEmpty. Operand 112172 states and 477158 transitions. [2019-12-27 07:52:04,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 07:52:04,354 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:52:04,354 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:52:04,354 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:52:04,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:52:04,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1970067083, now seen corresponding path program 1 times [2019-12-27 07:52:04,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:52:04,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040420140] [2019-12-27 07:52:04,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:52:04,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:52:04,456 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 07:52:04,457 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040420140] [2019-12-27 07:52:04,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:52:04,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:52:04,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350738592] [2019-12-27 07:52:04,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:52:04,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:52:04,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:52:04,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:52:04,461 INFO L87 Difference]: Start difference. First operand 112172 states and 477158 transitions. Second operand 4 states. [2019-12-27 07:52:10,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:52:10,031 INFO L93 Difference]: Finished difference Result 175422 states and 718454 transitions. [2019-12-27 07:52:10,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:52:10,031 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 07:52:10,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:52:10,611 INFO L225 Difference]: With dead ends: 175422 [2019-12-27 07:52:10,611 INFO L226 Difference]: Without dead ends: 175373 [2019-12-27 07:52:10,612 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 07:52:15,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175373 states. [2019-12-27 07:52:18,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175373 to 159145. [2019-12-27 07:52:18,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159145 states. [2019-12-27 07:52:26,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159145 states to 159145 states and 659586 transitions. [2019-12-27 07:52:26,617 INFO L78 Accepts]: Start accepts. Automaton has 159145 states and 659586 transitions. Word has length 11 [2019-12-27 07:52:26,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:52:26,618 INFO L462 AbstractCegarLoop]: Abstraction has 159145 states and 659586 transitions. [2019-12-27 07:52:26,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:52:26,619 INFO L276 IsEmpty]: Start isEmpty. Operand 159145 states and 659586 transitions. [2019-12-27 07:52:26,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 07:52:26,634 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:52:26,635 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:52:26,635 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:52:26,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:52:26,638 INFO L82 PathProgramCache]: Analyzing trace with hash -590582251, now seen corresponding path program 1 times [2019-12-27 07:52:26,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:52:26,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269820697] [2019-12-27 07:52:26,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:52:26,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:52:26,770 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 07:52:26,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269820697] [2019-12-27 07:52:26,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:52:26,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:52:26,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549844678] [2019-12-27 07:52:26,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:52:26,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:52:26,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:52:26,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:52:26,772 INFO L87 Difference]: Start difference. First operand 159145 states and 659586 transitions. Second operand 4 states. [2019-12-27 07:52:28,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:52:28,240 INFO L93 Difference]: Finished difference Result 228110 states and 923913 transitions. [2019-12-27 07:52:28,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:52:28,241 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 07:52:28,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:52:31,024 INFO L225 Difference]: With dead ends: 228110 [2019-12-27 07:52:31,025 INFO L226 Difference]: Without dead ends: 228047 [2019-12-27 07:52:31,025 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 07:52:42,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228047 states. [2019-12-27 07:52:45,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228047 to 192443. [2019-12-27 07:52:45,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192443 states. [2019-12-27 07:52:46,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192443 states to 192443 states and 792052 transitions. [2019-12-27 07:52:46,987 INFO L78 Accepts]: Start accepts. Automaton has 192443 states and 792052 transitions. Word has length 13 [2019-12-27 07:52:46,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:52:46,988 INFO L462 AbstractCegarLoop]: Abstraction has 192443 states and 792052 transitions. [2019-12-27 07:52:46,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:52:46,988 INFO L276 IsEmpty]: Start isEmpty. Operand 192443 states and 792052 transitions. [2019-12-27 07:52:46,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 07:52:46,992 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:52:46,992 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:52:46,992 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:52:46,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:52:46,993 INFO L82 PathProgramCache]: Analyzing trace with hash 339341104, now seen corresponding path program 1 times [2019-12-27 07:52:46,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:52:46,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403981717] [2019-12-27 07:52:46,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:52:47,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:52:47,035 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 07:52:47,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403981717] [2019-12-27 07:52:47,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:52:47,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:52:47,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797087071] [2019-12-27 07:52:47,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:52:47,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:52:47,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:52:47,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:52:47,038 INFO L87 Difference]: Start difference. First operand 192443 states and 792052 transitions. Second operand 3 states. [2019-12-27 07:52:47,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:52:47,171 INFO L93 Difference]: Finished difference Result 37880 states and 121975 transitions. [2019-12-27 07:52:47,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:52:47,171 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 07:52:47,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:52:47,229 INFO L225 Difference]: With dead ends: 37880 [2019-12-27 07:52:47,229 INFO L226 Difference]: Without dead ends: 37880 [2019-12-27 07:52:47,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:52:47,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37880 states. [2019-12-27 07:52:49,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37880 to 37880. [2019-12-27 07:52:49,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37880 states. [2019-12-27 07:52:49,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37880 states to 37880 states and 121975 transitions. [2019-12-27 07:52:49,180 INFO L78 Accepts]: Start accepts. Automaton has 37880 states and 121975 transitions. Word has length 13 [2019-12-27 07:52:49,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:52:49,180 INFO L462 AbstractCegarLoop]: Abstraction has 37880 states and 121975 transitions. [2019-12-27 07:52:49,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:52:49,180 INFO L276 IsEmpty]: Start isEmpty. Operand 37880 states and 121975 transitions. [2019-12-27 07:52:49,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 07:52:49,184 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:52:49,185 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:52:49,185 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:52:49,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:52:49,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1793457831, now seen corresponding path program 1 times [2019-12-27 07:52:49,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:52:49,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787618445] [2019-12-27 07:52:49,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:52:49,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:52:49,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:52:49,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787618445] [2019-12-27 07:52:49,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:52:49,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:52:49,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759534190] [2019-12-27 07:52:49,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:52:49,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:52:49,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:52:49,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:52:49,307 INFO L87 Difference]: Start difference. First operand 37880 states and 121975 transitions. Second operand 5 states. [2019-12-27 07:52:50,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:52:50,100 INFO L93 Difference]: Finished difference Result 51102 states and 161291 transitions. [2019-12-27 07:52:50,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 07:52:50,101 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-27 07:52:50,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:52:50,186 INFO L225 Difference]: With dead ends: 51102 [2019-12-27 07:52:50,186 INFO L226 Difference]: Without dead ends: 51089 [2019-12-27 07:52:50,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 07:52:50,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51089 states. [2019-12-27 07:52:50,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51089 to 38340. [2019-12-27 07:52:50,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38340 states. [2019-12-27 07:52:54,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38340 states to 38340 states and 123285 transitions. [2019-12-27 07:52:54,248 INFO L78 Accepts]: Start accepts. Automaton has 38340 states and 123285 transitions. Word has length 19 [2019-12-27 07:52:54,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:52:54,248 INFO L462 AbstractCegarLoop]: Abstraction has 38340 states and 123285 transitions. [2019-12-27 07:52:54,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:52:54,248 INFO L276 IsEmpty]: Start isEmpty. Operand 38340 states and 123285 transitions. [2019-12-27 07:52:54,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 07:52:54,257 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:52:54,257 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 07:52:54,258 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:52:54,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:52:54,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1227724886, now seen corresponding path program 1 times [2019-12-27 07:52:54,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:52:54,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114700491] [2019-12-27 07:52:54,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:52:54,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:52:54,312 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 07:52:54,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114700491] [2019-12-27 07:52:54,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:52:54,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:52:54,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047765001] [2019-12-27 07:52:54,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:52:54,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:52:54,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:52:54,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:52:54,316 INFO L87 Difference]: Start difference. First operand 38340 states and 123285 transitions. Second operand 4 states. [2019-12-27 07:52:54,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:52:54,354 INFO L93 Difference]: Finished difference Result 7755 states and 21286 transitions. [2019-12-27 07:52:54,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 07:52:54,355 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 07:52:54,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:52:54,366 INFO L225 Difference]: With dead ends: 7755 [2019-12-27 07:52:54,366 INFO L226 Difference]: Without dead ends: 7755 [2019-12-27 07:52:54,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:52:54,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7755 states. [2019-12-27 07:52:54,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7755 to 7615. [2019-12-27 07:52:54,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7615 states. [2019-12-27 07:52:54,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7615 states to 7615 states and 20886 transitions. [2019-12-27 07:52:54,463 INFO L78 Accepts]: Start accepts. Automaton has 7615 states and 20886 transitions. Word has length 25 [2019-12-27 07:52:54,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:52:54,463 INFO L462 AbstractCegarLoop]: Abstraction has 7615 states and 20886 transitions. [2019-12-27 07:52:54,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:52:54,463 INFO L276 IsEmpty]: Start isEmpty. Operand 7615 states and 20886 transitions. [2019-12-27 07:52:54,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 07:52:54,474 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:52:54,474 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 07:52:54,474 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:52:54,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:52:54,474 INFO L82 PathProgramCache]: Analyzing trace with hash 287382448, now seen corresponding path program 1 times [2019-12-27 07:52:54,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:52:54,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424330622] [2019-12-27 07:52:54,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:52:54,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:52:54,549 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 07:52:54,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424330622] [2019-12-27 07:52:54,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:52:54,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 07:52:54,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651549662] [2019-12-27 07:52:54,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:52:54,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:52:54,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:52:54,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:52:54,552 INFO L87 Difference]: Start difference. First operand 7615 states and 20886 transitions. Second operand 5 states. [2019-12-27 07:52:54,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:52:54,597 INFO L93 Difference]: Finished difference Result 5711 states and 16438 transitions. [2019-12-27 07:52:54,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:52:54,598 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-27 07:52:54,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:52:54,609 INFO L225 Difference]: With dead ends: 5711 [2019-12-27 07:52:54,609 INFO L226 Difference]: Without dead ends: 5711 [2019-12-27 07:52:54,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:52:54,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5711 states. [2019-12-27 07:52:54,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5711 to 5298. [2019-12-27 07:52:54,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5298 states. [2019-12-27 07:52:54,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5298 states to 5298 states and 15321 transitions. [2019-12-27 07:52:54,717 INFO L78 Accepts]: Start accepts. Automaton has 5298 states and 15321 transitions. Word has length 37 [2019-12-27 07:52:54,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:52:54,718 INFO L462 AbstractCegarLoop]: Abstraction has 5298 states and 15321 transitions. [2019-12-27 07:52:54,718 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:52:54,718 INFO L276 IsEmpty]: Start isEmpty. Operand 5298 states and 15321 transitions. [2019-12-27 07:52:54,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 07:52:54,728 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:52:54,729 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:52:54,729 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:52:54,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:52:54,729 INFO L82 PathProgramCache]: Analyzing trace with hash -2078347018, now seen corresponding path program 1 times [2019-12-27 07:52:54,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:52:54,730 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437127556] [2019-12-27 07:52:54,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:52:54,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:52:54,802 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 07:52:54,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437127556] [2019-12-27 07:52:54,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:52:54,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:52:54,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392056071] [2019-12-27 07:52:54,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:52:54,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:52:54,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:52:54,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:52:54,804 INFO L87 Difference]: Start difference. First operand 5298 states and 15321 transitions. Second operand 3 states. [2019-12-27 07:52:54,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:52:54,855 INFO L93 Difference]: Finished difference Result 5309 states and 15335 transitions. [2019-12-27 07:52:54,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:52:54,856 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 07:52:54,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:52:54,869 INFO L225 Difference]: With dead ends: 5309 [2019-12-27 07:52:54,869 INFO L226 Difference]: Without dead ends: 5309 [2019-12-27 07:52:54,869 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 07:52:54,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5309 states. [2019-12-27 07:52:54,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5309 to 5303. [2019-12-27 07:52:54,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5303 states. [2019-12-27 07:52:54,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5303 states to 5303 states and 15329 transitions. [2019-12-27 07:52:54,981 INFO L78 Accepts]: Start accepts. Automaton has 5303 states and 15329 transitions. Word has length 65 [2019-12-27 07:52:54,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:52:54,981 INFO L462 AbstractCegarLoop]: Abstraction has 5303 states and 15329 transitions. [2019-12-27 07:52:54,981 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:52:54,982 INFO L276 IsEmpty]: Start isEmpty. Operand 5303 states and 15329 transitions. [2019-12-27 07:52:54,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 07:52:54,990 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:52:54,991 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:52:54,991 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:52:54,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:52:54,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1997644654, now seen corresponding path program 1 times [2019-12-27 07:52:54,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:52:54,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140905512] [2019-12-27 07:52:54,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:52:55,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:52:55,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:52:55,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140905512] [2019-12-27 07:52:55,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:52:55,106 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 07:52:55,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296468372] [2019-12-27 07:52:55,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:52:55,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:52:55,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:52:55,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:52:55,107 INFO L87 Difference]: Start difference. First operand 5303 states and 15329 transitions. Second operand 5 states. [2019-12-27 07:52:55,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:52:55,447 INFO L93 Difference]: Finished difference Result 7909 states and 22523 transitions. [2019-12-27 07:52:55,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 07:52:55,447 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-27 07:52:55,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:52:55,459 INFO L225 Difference]: With dead ends: 7909 [2019-12-27 07:52:55,459 INFO L226 Difference]: Without dead ends: 7909 [2019-12-27 07:52:55,460 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:52:55,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7909 states. [2019-12-27 07:52:55,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7909 to 5799. [2019-12-27 07:52:55,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5799 states. [2019-12-27 07:52:55,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5799 states to 5799 states and 16803 transitions. [2019-12-27 07:52:55,556 INFO L78 Accepts]: Start accepts. Automaton has 5799 states and 16803 transitions. Word has length 65 [2019-12-27 07:52:55,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:52:55,557 INFO L462 AbstractCegarLoop]: Abstraction has 5799 states and 16803 transitions. [2019-12-27 07:52:55,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:52:55,557 INFO L276 IsEmpty]: Start isEmpty. Operand 5799 states and 16803 transitions. [2019-12-27 07:52:55,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 07:52:55,565 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:52:55,565 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:52:55,565 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:52:55,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:52:55,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1435529848, now seen corresponding path program 2 times [2019-12-27 07:52:55,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:52:55,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550511232] [2019-12-27 07:52:55,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:52:55,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:52:55,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:52:55,676 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550511232] [2019-12-27 07:52:55,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:52:55,676 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 07:52:55,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841501619] [2019-12-27 07:52:55,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 07:52:55,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:52:55,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 07:52:55,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:52:55,678 INFO L87 Difference]: Start difference. First operand 5799 states and 16803 transitions. Second operand 6 states. [2019-12-27 07:52:56,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:52:56,099 INFO L93 Difference]: Finished difference Result 8328 states and 23514 transitions. [2019-12-27 07:52:56,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 07:52:56,100 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-27 07:52:56,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:52:56,113 INFO L225 Difference]: With dead ends: 8328 [2019-12-27 07:52:56,113 INFO L226 Difference]: Without dead ends: 8328 [2019-12-27 07:52:56,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-27 07:52:56,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8328 states. [2019-12-27 07:52:56,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8328 to 6698. [2019-12-27 07:52:56,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6698 states. [2019-12-27 07:52:56,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6698 states to 6698 states and 19094 transitions. [2019-12-27 07:52:56,237 INFO L78 Accepts]: Start accepts. Automaton has 6698 states and 19094 transitions. Word has length 65 [2019-12-27 07:52:56,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:52:56,238 INFO L462 AbstractCegarLoop]: Abstraction has 6698 states and 19094 transitions. [2019-12-27 07:52:56,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 07:52:56,238 INFO L276 IsEmpty]: Start isEmpty. Operand 6698 states and 19094 transitions. [2019-12-27 07:52:56,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 07:52:56,247 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:52:56,247 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:52:56,247 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:52:56,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:52:56,248 INFO L82 PathProgramCache]: Analyzing trace with hash 669516774, now seen corresponding path program 3 times [2019-12-27 07:52:56,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:52:56,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77092348] [2019-12-27 07:52:56,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:52:56,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:52:56,316 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 07:52:56,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77092348] [2019-12-27 07:52:56,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:52:56,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:52:56,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780349654] [2019-12-27 07:52:56,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:52:56,319 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:52:56,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:52:56,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:52:56,320 INFO L87 Difference]: Start difference. First operand 6698 states and 19094 transitions. Second operand 3 states. [2019-12-27 07:52:56,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:52:56,356 INFO L93 Difference]: Finished difference Result 6334 states and 17863 transitions. [2019-12-27 07:52:56,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:52:56,356 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 07:52:56,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:52:56,367 INFO L225 Difference]: With dead ends: 6334 [2019-12-27 07:52:56,367 INFO L226 Difference]: Without dead ends: 6334 [2019-12-27 07:52:56,368 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 07:52:56,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6334 states. [2019-12-27 07:52:56,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6334 to 6166. [2019-12-27 07:52:56,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6166 states. [2019-12-27 07:52:56,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6166 states to 6166 states and 17397 transitions. [2019-12-27 07:52:56,511 INFO L78 Accepts]: Start accepts. Automaton has 6166 states and 17397 transitions. Word has length 65 [2019-12-27 07:52:56,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:52:56,511 INFO L462 AbstractCegarLoop]: Abstraction has 6166 states and 17397 transitions. [2019-12-27 07:52:56,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:52:56,511 INFO L276 IsEmpty]: Start isEmpty. Operand 6166 states and 17397 transitions. [2019-12-27 07:52:56,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 07:52:56,523 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:52:56,523 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:52:56,523 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:52:56,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:52:56,523 INFO L82 PathProgramCache]: Analyzing trace with hash 890066617, now seen corresponding path program 1 times [2019-12-27 07:52:56,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:52:56,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223332654] [2019-12-27 07:52:56,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:52:56,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:52:56,725 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 07:52:56,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223332654] [2019-12-27 07:52:56,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:52:56,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 07:52:56,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343657815] [2019-12-27 07:52:56,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 07:52:56,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:52:56,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 07:52:56,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:52:56,728 INFO L87 Difference]: Start difference. First operand 6166 states and 17397 transitions. Second operand 7 states. [2019-12-27 07:52:57,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:52:57,118 INFO L93 Difference]: Finished difference Result 8317 states and 23206 transitions. [2019-12-27 07:52:57,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 07:52:57,119 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-27 07:52:57,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:52:57,130 INFO L225 Difference]: With dead ends: 8317 [2019-12-27 07:52:57,131 INFO L226 Difference]: Without dead ends: 8317 [2019-12-27 07:52:57,131 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 07:52:57,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8317 states. [2019-12-27 07:52:57,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8317 to 6558. [2019-12-27 07:52:57,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6558 states. [2019-12-27 07:52:57,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6558 states to 6558 states and 18489 transitions. [2019-12-27 07:52:57,301 INFO L78 Accepts]: Start accepts. Automaton has 6558 states and 18489 transitions. Word has length 66 [2019-12-27 07:52:57,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:52:57,301 INFO L462 AbstractCegarLoop]: Abstraction has 6558 states and 18489 transitions. [2019-12-27 07:52:57,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 07:52:57,302 INFO L276 IsEmpty]: Start isEmpty. Operand 6558 states and 18489 transitions. [2019-12-27 07:52:57,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 07:52:57,310 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:52:57,310 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:52:57,310 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:52:57,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:52:57,311 INFO L82 PathProgramCache]: Analyzing trace with hash 384398989, now seen corresponding path program 2 times [2019-12-27 07:52:57,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:52:57,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742396111] [2019-12-27 07:52:57,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:52:57,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:52:57,418 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 07:52:57,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742396111] [2019-12-27 07:52:57,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:52:57,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 07:52:57,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778987901] [2019-12-27 07:52:57,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 07:52:57,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:52:57,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 07:52:57,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:52:57,420 INFO L87 Difference]: Start difference. First operand 6558 states and 18489 transitions. Second operand 6 states. [2019-12-27 07:52:57,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:52:57,502 INFO L93 Difference]: Finished difference Result 11669 states and 32897 transitions. [2019-12-27 07:52:57,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 07:52:57,503 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-27 07:52:57,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:52:57,511 INFO L225 Difference]: With dead ends: 11669 [2019-12-27 07:52:57,511 INFO L226 Difference]: Without dead ends: 5502 [2019-12-27 07:52:57,511 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 07:52:57,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5502 states. [2019-12-27 07:52:57,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5502 to 5502. [2019-12-27 07:52:57,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5502 states. [2019-12-27 07:52:57,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5502 states to 5502 states and 15486 transitions. [2019-12-27 07:52:57,596 INFO L78 Accepts]: Start accepts. Automaton has 5502 states and 15486 transitions. Word has length 66 [2019-12-27 07:52:57,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:52:57,597 INFO L462 AbstractCegarLoop]: Abstraction has 5502 states and 15486 transitions. [2019-12-27 07:52:57,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 07:52:57,597 INFO L276 IsEmpty]: Start isEmpty. Operand 5502 states and 15486 transitions. [2019-12-27 07:52:57,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 07:52:57,604 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:52:57,604 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:52:57,604 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:52:57,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:52:57,604 INFO L82 PathProgramCache]: Analyzing trace with hash 111339391, now seen corresponding path program 3 times [2019-12-27 07:52:57,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:52:57,605 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404192664] [2019-12-27 07:52:57,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:52:57,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:52:57,666 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 07:52:57,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404192664] [2019-12-27 07:52:57,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:52:57,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:52:57,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20290512] [2019-12-27 07:52:57,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:52:57,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:52:57,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:52:57,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:52:57,668 INFO L87 Difference]: Start difference. First operand 5502 states and 15486 transitions. Second operand 3 states. [2019-12-27 07:52:57,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:52:57,714 INFO L93 Difference]: Finished difference Result 5502 states and 15485 transitions. [2019-12-27 07:52:57,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:52:57,715 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 07:52:57,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:52:57,722 INFO L225 Difference]: With dead ends: 5502 [2019-12-27 07:52:57,722 INFO L226 Difference]: Without dead ends: 5502 [2019-12-27 07:52:57,723 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 07:52:57,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5502 states. [2019-12-27 07:52:57,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5502 to 3241. [2019-12-27 07:52:57,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3241 states. [2019-12-27 07:52:57,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3241 states to 3241 states and 9242 transitions. [2019-12-27 07:52:57,791 INFO L78 Accepts]: Start accepts. Automaton has 3241 states and 9242 transitions. Word has length 66 [2019-12-27 07:52:57,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:52:57,791 INFO L462 AbstractCegarLoop]: Abstraction has 3241 states and 9242 transitions. [2019-12-27 07:52:57,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:52:57,791 INFO L276 IsEmpty]: Start isEmpty. Operand 3241 states and 9242 transitions. [2019-12-27 07:52:57,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 07:52:57,795 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:52:57,796 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:52:57,796 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:52:57,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:52:57,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1052432089, now seen corresponding path program 1 times [2019-12-27 07:52:57,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:52:57,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990469231] [2019-12-27 07:52:57,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:52:57,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:52:57,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:52:57,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990469231] [2019-12-27 07:52:57,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:52:57,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 07:52:57,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442491762] [2019-12-27 07:52:57,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 07:52:57,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:52:57,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 07:52:57,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 07:52:57,912 INFO L87 Difference]: Start difference. First operand 3241 states and 9242 transitions. Second operand 8 states. [2019-12-27 07:52:58,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:52:58,659 INFO L93 Difference]: Finished difference Result 6083 states and 17085 transitions. [2019-12-27 07:52:58,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 07:52:58,659 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 67 [2019-12-27 07:52:58,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:52:58,669 INFO L225 Difference]: With dead ends: 6083 [2019-12-27 07:52:58,669 INFO L226 Difference]: Without dead ends: 6083 [2019-12-27 07:52:58,669 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2019-12-27 07:52:58,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6083 states. [2019-12-27 07:52:58,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6083 to 3253. [2019-12-27 07:52:58,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3253 states. [2019-12-27 07:52:58,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3253 states to 3253 states and 9278 transitions. [2019-12-27 07:52:58,738 INFO L78 Accepts]: Start accepts. Automaton has 3253 states and 9278 transitions. Word has length 67 [2019-12-27 07:52:58,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:52:58,738 INFO L462 AbstractCegarLoop]: Abstraction has 3253 states and 9278 transitions. [2019-12-27 07:52:58,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 07:52:58,738 INFO L276 IsEmpty]: Start isEmpty. Operand 3253 states and 9278 transitions. [2019-12-27 07:52:58,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 07:52:58,743 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:52:58,743 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:52:58,744 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:52:58,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:52:58,744 INFO L82 PathProgramCache]: Analyzing trace with hash 254366237, now seen corresponding path program 2 times [2019-12-27 07:52:58,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:52:58,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652696025] [2019-12-27 07:52:58,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:52:58,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:52:58,827 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 07:52:58,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652696025] [2019-12-27 07:52:58,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:52:58,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:52:58,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105202719] [2019-12-27 07:52:58,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:52:58,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:52:58,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:52:58,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:52:58,829 INFO L87 Difference]: Start difference. First operand 3253 states and 9278 transitions. Second operand 3 states. [2019-12-27 07:52:58,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:52:58,849 INFO L93 Difference]: Finished difference Result 2932 states and 8177 transitions. [2019-12-27 07:52:58,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:52:58,850 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-27 07:52:58,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:52:58,854 INFO L225 Difference]: With dead ends: 2932 [2019-12-27 07:52:58,854 INFO L226 Difference]: Without dead ends: 2932 [2019-12-27 07:52:58,855 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 07:52:58,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2932 states. [2019-12-27 07:52:58,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2932 to 2818. [2019-12-27 07:52:58,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2818 states. [2019-12-27 07:52:58,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2818 states to 2818 states and 7858 transitions. [2019-12-27 07:52:58,914 INFO L78 Accepts]: Start accepts. Automaton has 2818 states and 7858 transitions. Word has length 67 [2019-12-27 07:52:58,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:52:58,915 INFO L462 AbstractCegarLoop]: Abstraction has 2818 states and 7858 transitions. [2019-12-27 07:52:58,915 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:52:58,915 INFO L276 IsEmpty]: Start isEmpty. Operand 2818 states and 7858 transitions. [2019-12-27 07:52:58,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 07:52:58,919 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:52:58,920 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:52:58,920 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:52:58,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:52:58,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1034762219, now seen corresponding path program 1 times [2019-12-27 07:52:58,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:52:58,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036120595] [2019-12-27 07:52:58,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:52:58,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 07:52:59,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 07:52:59,055 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 07:52:59,055 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 07:52:59,062 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] ULTIMATE.startENTRY-->L807: Formula: (let ((.cse0 (store |v_#valid_51| 0 0))) (and (= v_~main$tmp_guard0~0_10 0) (= 0 v_~weak$$choice0~0_8) (= 0 v_~x$r_buff0_thd0~0_84) (= v_~__unbuffered_p2_EBX~0_10 0) (= 0 v_~x$w_buff1~0_25) (= v_~main$tmp_guard1~0_11 0) (= 0 v_~x$r_buff0_thd3~0_22) (= |v_#NULL.offset_3| 0) (= 0 v_~x$r_buff0_thd1~0_22) (= v_~x$flush_delayed~0_16 0) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~x$w_buff0~0_26) (= 0 v_~x$read_delayed_var~0.base_8) (= v_~x~0_29 0) (= 0 v_~weak$$choice2~0_36) (= v_~y~0_12 0) (= |v_ULTIMATE.start_main_~#t2290~0.offset_18| 0) (= 0 v_~x$r_buff0_thd2~0_30) (= 0 v_~__unbuffered_p2_EAX~0_10) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t2290~0.base_24| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t2290~0.base_24|) |v_ULTIMATE.start_main_~#t2290~0.offset_18| 0)) |v_#memory_int_19|) (= 0 v_~x$read_delayed~0_8) (= 0 v_~x$read_delayed_var~0.offset_8) (= v_~x$r_buff1_thd1~0_20 0) (= v_~x$mem_tmp~0_10 0) (= v_~x$w_buff1_used~0_72 0) (= |v_#valid_49| (store .cse0 |v_ULTIMATE.start_main_~#t2290~0.base_24| 1)) (= 0 |v_#NULL.base_3|) (= 0 v_~__unbuffered_cnt~0_22) (= 0 v_~z~0_9) (= 0 v_~x$w_buff0_used~0_118) (= v_~x$r_buff1_thd0~0_54 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t2290~0.base_24|) (= v_~x$r_buff1_thd3~0_20 0) (= v_~x$r_buff1_thd2~0_20 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2290~0.base_24|) 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t2290~0.base_24| 4)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_8|, ~x$w_buff0~0=v_~x$w_buff0~0_26, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_10|, ~x$flush_delayed~0=v_~x$flush_delayed~0_16, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_12|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_15|, #NULL.offset=|v_#NULL.offset_3|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_10|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_14|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_20, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_22, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_13|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_14|, ULTIMATE.start_main_~#t2291~0.offset=|v_ULTIMATE.start_main_~#t2291~0.offset_16|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_16|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_15|, ULTIMATE.start_main_~#t2292~0.base=|v_ULTIMATE.start_main_~#t2292~0.base_18|, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_84, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_10, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_9|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_12|, ~x$w_buff1~0=v_~x$w_buff1~0_25, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_15|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_72, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_20, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_13|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_12|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_8, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|, ULTIMATE.start_main_~#t2292~0.offset=|v_ULTIMATE.start_main_~#t2292~0.offset_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~x~0=v_~x~0_29, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_22, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_8|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_10|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_12|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_13|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_20, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_10|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_16|, ~x$mem_tmp~0=v_~x$mem_tmp~0_10, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_12|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_15|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_14|, ~y~0=v_~y~0_12, ULTIMATE.start_main_~#t2290~0.offset=|v_ULTIMATE.start_main_~#t2290~0.offset_18|, ULTIMATE.start_main_~#t2290~0.base=|v_ULTIMATE.start_main_~#t2290~0.base_24|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_8|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_8|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_12|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_15|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_54, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_30, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_12|, #NULL.base=|v_#NULL.base_3|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_13|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_118, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_15|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_8, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_9, ~weak$$choice2~0=v_~weak$$choice2~0_36, ULTIMATE.start_main_~#t2291~0.base=|v_ULTIMATE.start_main_~#t2291~0.base_20|, ~x$read_delayed~0=v_~x$read_delayed~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ~x$w_buff0~0, ULTIMATE.start_main_#t~ite28, ~x$flush_delayed~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_~#t2291~0.offset, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ULTIMATE.start_main_~#t2292~0.base, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ~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~ite33, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t2292~0.offset, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet31, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite51, ~y~0, ULTIMATE.start_main_~#t2290~0.offset, ULTIMATE.start_main_~#t2290~0.base, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet23, 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, ~z~0, ~weak$$choice2~0, ULTIMATE.start_main_~#t2291~0.base, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 07:52:59,063 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [802] [802] L807-1-->L809: Formula: (and (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t2291~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t2291~0.offset_9|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2291~0.base_11|) (= |v_#valid_32| (store |v_#valid_33| |v_ULTIMATE.start_main_~#t2291~0.base_11| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t2291~0.base_11|)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t2291~0.base_11| 4)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2291~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2291~0.base_11|) |v_ULTIMATE.start_main_~#t2291~0.offset_9| 1)) |v_#memory_int_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_3|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_~#t2291~0.base=|v_ULTIMATE.start_main_~#t2291~0.base_11|, ULTIMATE.start_main_~#t2291~0.offset=|v_ULTIMATE.start_main_~#t2291~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet21, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2291~0.base, ULTIMATE.start_main_~#t2291~0.offset] because there is no mapped edge [2019-12-27 07:52:59,064 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L809-1-->L811: Formula: (and (= |v_ULTIMATE.start_main_~#t2292~0.offset_10| 0) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2292~0.base_11| 4) |v_#length_15|) (= (store |v_#valid_35| |v_ULTIMATE.start_main_~#t2292~0.base_11| 1) |v_#valid_34|) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t2292~0.base_11|)) (not (= 0 |v_ULTIMATE.start_main_~#t2292~0.base_11|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2292~0.base_11|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2292~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2292~0.base_11|) |v_ULTIMATE.start_main_~#t2292~0.offset_10| 2)) |v_#memory_int_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2292~0.base=|v_ULTIMATE.start_main_~#t2292~0.base_11|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t2292~0.offset=|v_ULTIMATE.start_main_~#t2292~0.offset_10|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2292~0.base, ULTIMATE.start_main_#t~nondet22, #valid, #memory_int, ULTIMATE.start_main_~#t2292~0.offset, #length] because there is no mapped edge [2019-12-27 07:52:59,064 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [809] [809] L4-->L764: Formula: (and (= ~x$r_buff0_thd2~0_Out1860564800 1) (= ~y~0_Out1860564800 1) (= ~x$r_buff1_thd2~0_Out1860564800 ~x$r_buff0_thd2~0_In1860564800) (not (= P1Thread1of1ForFork1___VERIFIER_assert_~expression_In1860564800 0)) (= ~x$r_buff1_thd1~0_Out1860564800 ~x$r_buff0_thd1~0_In1860564800) (= ~x$r_buff1_thd0~0_Out1860564800 ~x$r_buff0_thd0~0_In1860564800) (= ~x$r_buff0_thd3~0_In1860564800 ~x$r_buff1_thd3~0_Out1860564800)) InVars {P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In1860564800, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1860564800, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1860564800, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1860564800, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1860564800} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In1860564800, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1860564800, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1860564800, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_Out1860564800, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_Out1860564800, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_Out1860564800, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1860564800, ~y~0=~y~0_Out1860564800, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1860564800, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out1860564800} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 07:52:59,068 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L784-2-->L784-4: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd3~0_In-1308189072 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1308189072 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite15_Out-1308189072| ~x~0_In-1308189072) (or .cse0 .cse1)) (and (not .cse1) (= |P2Thread1of1ForFork2_#t~ite15_Out-1308189072| ~x$w_buff1~0_In-1308189072) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1308189072, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1308189072, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1308189072, ~x~0=~x~0_In-1308189072} OutVars{P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out-1308189072|, ~x$w_buff1~0=~x$w_buff1~0_In-1308189072, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1308189072, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1308189072, ~x~0=~x~0_In-1308189072} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-27 07:52:59,068 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L784-4-->L785: Formula: (= |v_P2Thread1of1ForFork2_#t~ite15_8| v_~x~0_18) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_8|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_7|, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_7|, ~x~0=v_~x~0_18} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, P2Thread1of1ForFork2_#t~ite16, ~x~0] because there is no mapped edge [2019-12-27 07:52:59,068 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L785-->L785-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd3~0_In367042798 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In367042798 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite17_Out367042798| 0) (not .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite17_Out367042798| ~x$w_buff0_used~0_In367042798) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In367042798, ~x$w_buff0_used~0=~x$w_buff0_used~0_In367042798} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In367042798, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out367042798|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In367042798} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-27 07:52:59,069 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L786-->L786-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In-82980679 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In-82980679 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In-82980679 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd3~0_In-82980679 256) 0))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite18_Out-82980679|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~x$w_buff1_used~0_In-82980679 |P2Thread1of1ForFork2_#t~ite18_Out-82980679|) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-82980679, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-82980679, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-82980679, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-82980679} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-82980679, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-82980679, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-82980679, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out-82980679|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-82980679} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-27 07:52:59,069 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L735-2-->L735-4: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd1~0_In-1141581735 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-1141581735 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite3_Out-1141581735| ~x~0_In-1141581735) (or .cse0 .cse1)) (and (not .cse0) (= ~x$w_buff1~0_In-1141581735 |P0Thread1of1ForFork0_#t~ite3_Out-1141581735|) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1141581735, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1141581735, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1141581735, ~x~0=~x~0_In-1141581735} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out-1141581735|, ~x$w_buff1~0=~x$w_buff1~0_In-1141581735, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1141581735, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1141581735, ~x~0=~x~0_In-1141581735} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3] because there is no mapped edge [2019-12-27 07:52:59,069 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L735-4-->L736: Formula: (= v_~x~0_19 |v_P0Thread1of1ForFork0_#t~ite3_8|) InVars {P0Thread1of1ForFork0_#t~ite3=|v_P0Thread1of1ForFork0_#t~ite3_8|} OutVars{P0Thread1of1ForFork0_#t~ite3=|v_P0Thread1of1ForFork0_#t~ite3_7|, P0Thread1of1ForFork0_#t~ite4=|v_P0Thread1of1ForFork0_#t~ite4_7|, ~x~0=v_~x~0_19} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4, ~x~0] because there is no mapped edge [2019-12-27 07:52:59,069 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L736-->L736-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-556491398 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-556491398 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-556491398 |P0Thread1of1ForFork0_#t~ite5_Out-556491398|)) (and (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-556491398|) (not .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-556491398, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-556491398} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-556491398|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-556491398, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-556491398} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 07:52:59,070 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L737-->L737-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-865532930 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-865532930 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd1~0_In-865532930 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In-865532930 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out-865532930| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite6_Out-865532930| ~x$w_buff1_used~0_In-865532930)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-865532930, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-865532930, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-865532930, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-865532930} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-865532930|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-865532930, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-865532930, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-865532930, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-865532930} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 07:52:59,071 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L738-->L738-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In184668048 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In184668048 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite7_Out184668048| 0) (not .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite7_Out184668048| ~x$r_buff0_thd1~0_In184668048) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In184668048, ~x$w_buff0_used~0=~x$w_buff0_used~0_In184668048} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In184668048, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out184668048|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In184668048} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-27 07:52:59,072 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L739-->L739-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In641737975 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In641737975 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In641737975 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd1~0_In641737975 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff1_thd1~0_In641737975 |P0Thread1of1ForFork0_#t~ite8_Out641737975|) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out641737975|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In641737975, ~x$w_buff1_used~0=~x$w_buff1_used~0_In641737975, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In641737975, ~x$w_buff0_used~0=~x$w_buff0_used~0_In641737975} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In641737975, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out641737975|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In641737975, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In641737975, ~x$w_buff0_used~0=~x$w_buff0_used~0_In641737975} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 07:52:59,072 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L739-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_15 |v_P0Thread1of1ForFork0_#t~ite8_8|) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} 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_16, ~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 07:52:59,073 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L765-->L765-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In1058100077 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In1058100077 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In1058100077 |P1Thread1of1ForFork1_#t~ite11_Out1058100077|)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out1058100077| 0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1058100077, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1058100077} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out1058100077|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1058100077, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1058100077} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 07:52:59,074 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L766-->L766-2: Formula: (let ((.cse2 (= (mod ~x$w_buff0_used~0_In-662439662 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In-662439662 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-662439662 256))) (.cse1 (= (mod ~x$r_buff1_thd2~0_In-662439662 256) 0))) (or (and (= ~x$w_buff1_used~0_In-662439662 |P1Thread1of1ForFork1_#t~ite12_Out-662439662|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P1Thread1of1ForFork1_#t~ite12_Out-662439662|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-662439662, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-662439662, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-662439662, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-662439662} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-662439662, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-662439662, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-662439662|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-662439662, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-662439662} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 07:52:59,075 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L767-->L768: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-774892575 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-774892575 256)))) (or (and (not .cse0) (= 0 ~x$r_buff0_thd2~0_Out-774892575) (not .cse1)) (and (= ~x$r_buff0_thd2~0_In-774892575 ~x$r_buff0_thd2~0_Out-774892575) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-774892575, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-774892575} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-774892575|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-774892575, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-774892575} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 07:52:59,075 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L768-->L768-2: Formula: (let ((.cse2 (= (mod ~x$w_buff0_used~0_In-1351954548 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In-1351954548 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1351954548 256))) (.cse1 (= (mod ~x$r_buff1_thd2~0_In-1351954548 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff1_thd2~0_In-1351954548 |P1Thread1of1ForFork1_#t~ite14_Out-1351954548|) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite14_Out-1351954548|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1351954548, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1351954548, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1351954548, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1351954548} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1351954548, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1351954548, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1351954548, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-1351954548|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1351954548} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 07:52:59,075 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L768-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd2~0_14 |v_P1Thread1of1ForFork1_#t~ite14_8|) (= (+ 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_14, ~__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 07:52:59,076 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L787-->L787-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In1574038974 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1574038974 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite19_Out1574038974| 0) (not .cse1)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite19_Out1574038974| ~x$r_buff0_thd3~0_In1574038974)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1574038974, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1574038974} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1574038974, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out1574038974|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1574038974} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-27 07:52:59,076 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L788-->L788-2: Formula: (let ((.cse2 (= (mod ~x$r_buff0_thd3~0_In1724113284 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In1724113284 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1724113284 256))) (.cse0 (= (mod ~x$r_buff1_thd3~0_In1724113284 256) 0))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite20_Out1724113284|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~x$r_buff1_thd3~0_In1724113284 |P2Thread1of1ForFork2_#t~ite20_Out1724113284|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1724113284, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1724113284, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1724113284, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1724113284} OutVars{P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out1724113284|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1724113284, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1724113284, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1724113284, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1724113284} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-27 07:52:59,077 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L788-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork2_#t~ite20_8| v_~x$r_buff1_thd3~0_15) (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_7|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_15, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, ~x$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-27 07:52:59,077 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L811-1-->L817: Formula: (and (= 3 v_~__unbuffered_cnt~0_10) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 07:52:59,078 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L817-2-->L817-5: Formula: (let ((.cse1 (= |ULTIMATE.start_main_#t~ite24_Out1465274744| |ULTIMATE.start_main_#t~ite25_Out1465274744|)) (.cse2 (= (mod ~x$r_buff1_thd0~0_In1465274744 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In1465274744 256)))) (or (and (= |ULTIMATE.start_main_#t~ite24_Out1465274744| ~x$w_buff1~0_In1465274744) (not .cse0) .cse1 (not .cse2)) (and (= ~x~0_In1465274744 |ULTIMATE.start_main_#t~ite24_Out1465274744|) .cse1 (or .cse2 .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1465274744, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1465274744, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1465274744, ~x~0=~x~0_In1465274744} OutVars{~x$w_buff1~0=~x$w_buff1~0_In1465274744, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out1465274744|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out1465274744|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1465274744, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1465274744, ~x~0=~x~0_In1465274744} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25] because there is no mapped edge [2019-12-27 07:52:59,078 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L818-->L818-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In-1321740765 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-1321740765 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite26_Out-1321740765|) (not .cse1)) (and (= ~x$w_buff0_used~0_In-1321740765 |ULTIMATE.start_main_#t~ite26_Out-1321740765|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1321740765, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1321740765} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1321740765, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-1321740765|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1321740765} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-27 07:52:59,079 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L819-->L819-2: Formula: (let ((.cse3 (= (mod ~x$r_buff1_thd0~0_In351383348 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In351383348 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In351383348 256))) (.cse0 (= (mod ~x$r_buff0_thd0~0_In351383348 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite27_Out351383348| 0)) (and (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite27_Out351383348| ~x$w_buff1_used~0_In351383348) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In351383348, ~x$w_buff1_used~0=~x$w_buff1_used~0_In351383348, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In351383348, ~x$w_buff0_used~0=~x$w_buff0_used~0_In351383348} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In351383348, ~x$w_buff1_used~0=~x$w_buff1_used~0_In351383348, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out351383348|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In351383348, ~x$w_buff0_used~0=~x$w_buff0_used~0_In351383348} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-27 07:52:59,080 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L820-->L820-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In1518150712 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1518150712 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite28_Out1518150712| ~x$r_buff0_thd0~0_In1518150712)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite28_Out1518150712| 0) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1518150712, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1518150712} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1518150712, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out1518150712|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1518150712} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-27 07:52:59,081 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L821-->L821-2: Formula: (let ((.cse3 (= (mod ~x$w_buff1_used~0_In-551707057 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd0~0_In-551707057 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd0~0_In-551707057 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-551707057 256)))) (or (and (= ~x$r_buff1_thd0~0_In-551707057 |ULTIMATE.start_main_#t~ite29_Out-551707057|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite29_Out-551707057|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-551707057, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-551707057, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-551707057, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-551707057} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-551707057, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-551707057|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-551707057, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-551707057, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-551707057} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-27 07:52:59,089 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L832-->L832-8: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite44_Out563499812| |ULTIMATE.start_main_#t~ite45_Out563499812|)) (.cse4 (= 0 (mod ~x$w_buff0_used~0_In563499812 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In563499812 256))) (.cse6 (= (mod ~x$r_buff0_thd0~0_In563499812 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In563499812 256))) (.cse5 (= (mod ~weak$$choice2~0_In563499812 256) 0))) (or (let ((.cse1 (not .cse6))) (and (= |ULTIMATE.start_main_#t~ite43_Out563499812| 0) .cse0 (or .cse1 (not .cse2)) (or .cse1 (not .cse3)) (not .cse4) (= |ULTIMATE.start_main_#t~ite44_Out563499812| |ULTIMATE.start_main_#t~ite43_Out563499812|) .cse5)) (and (or (and (= |ULTIMATE.start_main_#t~ite44_Out563499812| |ULTIMATE.start_main_#t~ite44_In563499812|) (not .cse5) (= ~x$w_buff1_used~0_In563499812 |ULTIMATE.start_main_#t~ite45_Out563499812|)) (and .cse0 (= |ULTIMATE.start_main_#t~ite44_Out563499812| ~x$w_buff1_used~0_In563499812) (or .cse4 (and .cse6 .cse2) (and .cse6 .cse3)) .cse5)) (= |ULTIMATE.start_main_#t~ite43_In563499812| |ULTIMATE.start_main_#t~ite43_Out563499812|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In563499812, ~x$w_buff1_used~0=~x$w_buff1_used~0_In563499812, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In563499812, ~weak$$choice2~0=~weak$$choice2~0_In563499812, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_In563499812|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In563499812, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_In563499812|} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In563499812, ~x$w_buff1_used~0=~x$w_buff1_used~0_In563499812, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In563499812, ~weak$$choice2~0=~weak$$choice2~0_In563499812, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out563499812|, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out563499812|, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out563499812|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In563499812} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 07:52:59,090 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L833-->L834: Formula: (and (= v_~x$r_buff0_thd0~0_69 v_~x$r_buff0_thd0~0_70) (not (= 0 (mod v_~weak$$choice2~0_26 256)))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_70, ~weak$$choice2~0=v_~weak$$choice2~0_26} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_69, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_8|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_7|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_8|, ~weak$$choice2~0=v_~weak$$choice2~0_26} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 07:52:59,091 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L834-->L834-8: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff0_used~0_In41740920 256))) (.cse0 (= 0 (mod ~weak$$choice2~0_In41740920 256))) (.cse5 (= (mod ~x$r_buff1_thd0~0_In41740920 256) 0)) (.cse1 (= |ULTIMATE.start_main_#t~ite51_Out41740920| |ULTIMATE.start_main_#t~ite50_Out41740920|)) (.cse4 (= (mod ~x$w_buff1_used~0_In41740920 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd0~0_In41740920 256) 0))) (or (and (or (and (= |ULTIMATE.start_main_#t~ite50_Out41740920| |ULTIMATE.start_main_#t~ite50_In41740920|) (not .cse0) (= |ULTIMATE.start_main_#t~ite51_Out41740920| ~x$r_buff1_thd0~0_In41740920)) (and (= |ULTIMATE.start_main_#t~ite50_Out41740920| ~x$r_buff1_thd0~0_In41740920) .cse0 .cse1 (or .cse2 (and .cse3 .cse4) (and .cse3 .cse5)))) (= |ULTIMATE.start_main_#t~ite49_In41740920| |ULTIMATE.start_main_#t~ite49_Out41740920|)) (let ((.cse6 (not .cse3))) (and (not .cse2) .cse0 (= |ULTIMATE.start_main_#t~ite50_Out41740920| |ULTIMATE.start_main_#t~ite49_Out41740920|) (or .cse6 (not .cse5)) .cse1 (or .cse6 (not .cse4)) (= 0 |ULTIMATE.start_main_#t~ite49_Out41740920|))))) InVars {ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_In41740920|, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In41740920, ~x$w_buff1_used~0=~x$w_buff1_used~0_In41740920, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_In41740920|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In41740920, ~weak$$choice2~0=~weak$$choice2~0_In41740920, ~x$w_buff0_used~0=~x$w_buff0_used~0_In41740920} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out41740920|, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In41740920, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out41740920|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In41740920, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out41740920|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In41740920, ~weak$$choice2~0=~weak$$choice2~0_In41740920, ~x$w_buff0_used~0=~x$w_buff0_used~0_In41740920} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite51, ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 07:52:59,092 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [806] [806] L836-->L839-1: Formula: (and (not (= 0 (mod v_~x$flush_delayed~0_11 256))) (= v_~x$mem_tmp~0_6 v_~x~0_24) (= (mod v_~main$tmp_guard1~0_5 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|) (= 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_5, ~x$mem_tmp~0=v_~x$mem_tmp~0_6} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_9|, ~x$flush_delayed~0=v_~x$flush_delayed~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_5, ~x$mem_tmp~0=v_~x$mem_tmp~0_6, ~x~0=v_~x~0_24, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ~x$flush_delayed~0, ~x~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 07:52:59,093 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L839-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 07:52:59,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 07:52:59 BasicIcfg [2019-12-27 07:52:59,214 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 07:52:59,216 INFO L168 Benchmark]: Toolchain (without parser) took 94162.20 ms. Allocated memory was 138.4 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 100.2 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-27 07:52:59,217 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 138.4 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 07:52:59,222 INFO L168 Benchmark]: CACSL2BoogieTranslator took 828.89 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 100.0 MB in the beginning and 155.4 MB in the end (delta: -55.3 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. [2019-12-27 07:52:59,223 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.72 ms. Allocated memory is still 202.4 MB. Free memory was 155.4 MB in the beginning and 152.1 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-12-27 07:52:59,224 INFO L168 Benchmark]: Boogie Preprocessor took 43.17 ms. Allocated memory is still 202.4 MB. Free memory was 152.1 MB in the beginning and 149.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 07:52:59,225 INFO L168 Benchmark]: RCFGBuilder took 859.36 ms. Allocated memory is still 202.4 MB. Free memory was 149.4 MB in the beginning and 99.5 MB in the end (delta: 50.0 MB). Peak memory consumption was 50.0 MB. Max. memory is 7.1 GB. [2019-12-27 07:52:59,227 INFO L168 Benchmark]: TraceAbstraction took 92353.42 ms. Allocated memory was 202.4 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 99.5 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2019-12-27 07:52:59,237 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.20 ms. Allocated memory is still 138.4 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 828.89 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 100.0 MB in the beginning and 155.4 MB in the end (delta: -55.3 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 71.72 ms. Allocated memory is still 202.4 MB. Free memory was 155.4 MB in the beginning and 152.1 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.17 ms. Allocated memory is still 202.4 MB. Free memory was 152.1 MB in the beginning and 149.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 859.36 ms. Allocated memory is still 202.4 MB. Free memory was 149.4 MB in the beginning and 99.5 MB in the end (delta: 50.0 MB). Peak memory consumption was 50.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 92353.42 ms. Allocated memory was 202.4 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 99.5 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.0s, 175 ProgramPointsBefore, 93 ProgramPointsAfterwards, 212 TransitionsBefore, 101 TransitionsAfterwards, 17074 CoEnabledTransitionPairs, 8 FixpointIterations, 32 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 33 ChoiceCompositions, 5662 VarBasedMoverChecksPositive, 181 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 91912 CheckedPairsTotal, 111 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L807] FCALL, FORK 0 pthread_create(&t2290, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L809] FCALL, FORK 0 pthread_create(&t2291, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L749] 2 x$w_buff1 = x$w_buff0 [L750] 2 x$w_buff0 = 2 [L751] 2 x$w_buff1_used = x$w_buff0_used [L752] 2 x$w_buff0_used = (_Bool)1 [L811] FCALL, FORK 0 pthread_create(&t2292, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L778] 3 __unbuffered_p2_EAX = y [L781] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L729] 1 z = 1 [L732] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L784] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L735] 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_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L785] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L736] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L737] 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 [L738] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L764] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L764] 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) [L765] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L766] 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 [L786] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L787] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L817] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L817] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L818] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L819] 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 [L820] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L821] 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 [L824] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L825] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L826] 0 x$flush_delayed = weak$$choice2 [L827] 0 x$mem_tmp = x VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L828] 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}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L828] 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) [L829] 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}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L829] 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)) [L830] EXPR 0 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)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L830] 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)) [L831] 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}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L831] 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)) [L832] 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)) [L834] 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)) [L835] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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 4 procedures, 166 locations, 2 error locations. Result: UNSAFE, OverallTime: 92.0s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 15.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2315 SDtfs, 1901 SDslu, 3644 SDs, 0 SdLazy, 2496 SolverSat, 90 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 105 GetRequests, 33 SyntacticMatches, 11 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=192443occurred 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: 51.7s AutomataMinimizationTime, 16 MinimizatonAttempts, 76012 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 783 NumberOfCodeBlocks, 783 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 699 ConstructedInterpolants, 0 QuantifiedInterpolants, 87106 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...