/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/podwr000_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 23:06:45,822 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 23:06:45,825 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 23:06:45,846 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 23:06:45,846 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 23:06:45,848 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 23:06:45,850 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 23:06:45,861 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 23:06:45,864 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 23:06:45,867 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 23:06:45,869 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 23:06:45,871 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 23:06:45,871 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 23:06:45,873 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 23:06:45,876 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 23:06:45,877 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 23:06:45,879 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 23:06:45,879 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 23:06:45,881 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 23:06:45,886 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 23:06:45,890 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 23:06:45,894 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 23:06:45,895 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 23:06:45,896 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 23:06:45,898 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 23:06:45,898 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 23:06:45,898 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 23:06:45,900 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 23:06:45,901 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 23:06:45,902 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 23:06:45,903 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 23:06:45,903 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 23:06:45,904 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 23:06:45,905 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 23:06:45,906 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 23:06:45,906 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 23:06:45,907 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 23:06:45,907 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 23:06:45,907 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 23:06:45,908 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 23:06:45,909 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 23:06:45,910 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 23:06:45,944 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 23:06:45,944 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 23:06:45,948 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 23:06:45,949 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 23:06:45,949 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 23:06:45,949 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 23:06:45,949 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 23:06:45,950 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 23:06:45,950 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 23:06:45,950 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 23:06:45,950 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 23:06:45,950 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 23:06:45,950 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 23:06:45,951 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 23:06:45,951 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 23:06:45,952 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 23:06:45,952 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 23:06:45,952 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 23:06:45,952 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 23:06:45,952 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 23:06:45,953 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 23:06:45,953 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 23:06:45,953 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 23:06:45,953 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 23:06:45,953 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 23:06:45,954 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 23:06:45,954 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 23:06:45,954 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 23:06:45,954 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 23:06:45,954 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 23:06:46,249 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 23:06:46,270 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 23:06:46,274 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 23:06:46,275 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 23:06:46,276 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 23:06:46,277 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/podwr000_tso.opt.i [2019-12-26 23:06:46,350 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/564b27e2b/2ce91fd51305401086f744564bc331b0/FLAGe27e32ff0 [2019-12-26 23:06:46,914 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 23:06:46,914 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/podwr000_tso.opt.i [2019-12-26 23:06:46,929 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/564b27e2b/2ce91fd51305401086f744564bc331b0/FLAGe27e32ff0 [2019-12-26 23:06:47,161 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/564b27e2b/2ce91fd51305401086f744564bc331b0 [2019-12-26 23:06:47,170 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 23:06:47,172 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 23:06:47,173 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 23:06:47,173 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 23:06:47,176 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 23:06:47,177 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:06:47" (1/1) ... [2019-12-26 23:06:47,180 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1eb8f213 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:06:47, skipping insertion in model container [2019-12-26 23:06:47,181 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:06:47" (1/1) ... [2019-12-26 23:06:47,189 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 23:06:47,253 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 23:06:47,747 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:06:47,760 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 23:06:47,853 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:06:47,925 INFO L208 MainTranslator]: Completed translation [2019-12-26 23:06:47,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:06:47 WrapperNode [2019-12-26 23:06:47,925 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 23:06:47,926 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 23:06:47,926 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 23:06:47,926 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 23:06:47,935 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:06:47" (1/1) ... [2019-12-26 23:06:47,956 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:06:47" (1/1) ... [2019-12-26 23:06:47,988 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 23:06:47,988 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 23:06:47,988 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 23:06:47,989 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 23:06:47,997 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:06:47" (1/1) ... [2019-12-26 23:06:47,997 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:06:47" (1/1) ... [2019-12-26 23:06:48,002 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:06:47" (1/1) ... [2019-12-26 23:06:48,002 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:06:47" (1/1) ... [2019-12-26 23:06:48,012 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:06:47" (1/1) ... [2019-12-26 23:06:48,017 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:06:47" (1/1) ... [2019-12-26 23:06:48,020 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:06:47" (1/1) ... [2019-12-26 23:06:48,025 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 23:06:48,026 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 23:06:48,026 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 23:06:48,026 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 23:06:48,027 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:06:47" (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-26 23:06:48,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 23:06:48,094 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 23:06:48,094 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 23:06:48,095 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 23:06:48,095 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 23:06:48,095 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 23:06:48,095 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 23:06:48,095 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 23:06:48,095 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 23:06:48,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 23:06:48,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 23:06:48,098 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 23:06:48,770 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 23:06:48,770 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 23:06:48,771 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:06:48 BoogieIcfgContainer [2019-12-26 23:06:48,772 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 23:06:48,773 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 23:06:48,774 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 23:06:48,779 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 23:06:48,780 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 11:06:47" (1/3) ... [2019-12-26 23:06:48,781 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ba5dd30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:06:48, skipping insertion in model container [2019-12-26 23:06:48,782 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:06:47" (2/3) ... [2019-12-26 23:06:48,783 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ba5dd30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:06:48, skipping insertion in model container [2019-12-26 23:06:48,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:06:48" (3/3) ... [2019-12-26 23:06:48,787 INFO L109 eAbstractionObserver]: Analyzing ICFG podwr000_tso.opt.i [2019-12-26 23:06:48,800 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 23:06:48,800 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 23:06:48,812 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 23:06:48,813 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 23:06:48,876 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,876 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,876 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,877 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,877 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,877 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,878 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,878 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,878 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,879 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,879 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,879 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,879 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,880 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,881 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,882 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,882 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,882 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,883 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,883 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,883 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,883 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,884 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,884 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,884 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,885 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,885 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,885 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,885 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,886 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,886 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,886 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,887 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,887 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,890 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,891 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,891 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,891 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,892 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,892 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,893 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,893 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,919 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,919 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,919 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,944 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,945 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,945 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,973 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,976 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:48,992 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-26 23:06:49,013 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 23:06:49,013 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 23:06:49,013 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 23:06:49,013 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 23:06:49,014 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 23:06:49,014 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 23:06:49,014 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 23:06:49,014 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 23:06:49,031 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-26 23:06:49,033 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-26 23:06:49,131 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-26 23:06:49,131 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:06:49,149 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 345 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-26 23:06:49,166 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-26 23:06:49,242 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-26 23:06:49,242 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:06:49,249 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 345 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-26 23:06:49,263 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-26 23:06:49,265 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 23:06:53,931 WARN L192 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-26 23:06:54,114 INFO L206 etLargeBlockEncoding]: Checked pairs total: 49472 [2019-12-26 23:06:54,115 INFO L214 etLargeBlockEncoding]: Total number of compositions: 106 [2019-12-26 23:06:54,119 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 75 places, 84 transitions [2019-12-26 23:06:54,552 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8220 states. [2019-12-26 23:06:54,555 INFO L276 IsEmpty]: Start isEmpty. Operand 8220 states. [2019-12-26 23:06:54,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-26 23:06:54,561 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:06:54,562 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-26 23:06:54,563 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:06:54,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:06:54,569 INFO L82 PathProgramCache]: Analyzing trace with hash 795105, now seen corresponding path program 1 times [2019-12-26 23:06:54,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:06:54,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745419681] [2019-12-26 23:06:54,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:06:54,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:06:54,784 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-26 23:06:54,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745419681] [2019-12-26 23:06:54,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:06:54,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 23:06:54,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361830149] [2019-12-26 23:06:54,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:06:54,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:06:54,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:06:54,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:06:54,809 INFO L87 Difference]: Start difference. First operand 8220 states. Second operand 3 states. [2019-12-26 23:06:55,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:06:55,077 INFO L93 Difference]: Finished difference Result 8074 states and 26190 transitions. [2019-12-26 23:06:55,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:06:55,079 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-26 23:06:55,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:06:55,173 INFO L225 Difference]: With dead ends: 8074 [2019-12-26 23:06:55,173 INFO L226 Difference]: Without dead ends: 7606 [2019-12-26 23:06:55,175 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-26 23:06:55,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7606 states. [2019-12-26 23:06:55,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7606 to 7606. [2019-12-26 23:06:55,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7606 states. [2019-12-26 23:06:55,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7606 states to 7606 states and 24627 transitions. [2019-12-26 23:06:55,687 INFO L78 Accepts]: Start accepts. Automaton has 7606 states and 24627 transitions. Word has length 3 [2019-12-26 23:06:55,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:06:55,687 INFO L462 AbstractCegarLoop]: Abstraction has 7606 states and 24627 transitions. [2019-12-26 23:06:55,687 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:06:55,687 INFO L276 IsEmpty]: Start isEmpty. Operand 7606 states and 24627 transitions. [2019-12-26 23:06:55,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 23:06:55,691 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:06:55,691 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:06:55,691 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:06:55,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:06:55,692 INFO L82 PathProgramCache]: Analyzing trace with hash 884428319, now seen corresponding path program 1 times [2019-12-26 23:06:55,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:06:55,692 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642803195] [2019-12-26 23:06:55,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:06:55,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:06:55,880 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-26 23:06:55,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642803195] [2019-12-26 23:06:55,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:06:55,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:06:55,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543302365] [2019-12-26 23:06:55,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:06:55,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:06:55,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:06:55,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:06:55,883 INFO L87 Difference]: Start difference. First operand 7606 states and 24627 transitions. Second operand 4 states. [2019-12-26 23:06:56,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:06:56,328 INFO L93 Difference]: Finished difference Result 11630 states and 36033 transitions. [2019-12-26 23:06:56,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:06:56,329 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-26 23:06:56,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:06:56,434 INFO L225 Difference]: With dead ends: 11630 [2019-12-26 23:06:56,435 INFO L226 Difference]: Without dead ends: 11623 [2019-12-26 23:06:56,436 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-26 23:06:56,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11623 states. [2019-12-26 23:06:56,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11623 to 10415. [2019-12-26 23:06:56,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10415 states. [2019-12-26 23:06:56,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10415 states to 10415 states and 32855 transitions. [2019-12-26 23:06:56,842 INFO L78 Accepts]: Start accepts. Automaton has 10415 states and 32855 transitions. Word has length 11 [2019-12-26 23:06:56,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:06:56,843 INFO L462 AbstractCegarLoop]: Abstraction has 10415 states and 32855 transitions. [2019-12-26 23:06:56,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:06:56,843 INFO L276 IsEmpty]: Start isEmpty. Operand 10415 states and 32855 transitions. [2019-12-26 23:06:56,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-26 23:06:57,403 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:06:57,403 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:06:57,403 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:06:57,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:06:57,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1398507206, now seen corresponding path program 1 times [2019-12-26 23:06:57,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:06:57,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56553678] [2019-12-26 23:06:57,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:06:57,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:06:57,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:06:57,486 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56553678] [2019-12-26 23:06:57,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:06:57,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:06:57,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933142764] [2019-12-26 23:06:57,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:06:57,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:06:57,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:06:57,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:06:57,488 INFO L87 Difference]: Start difference. First operand 10415 states and 32855 transitions. Second operand 5 states. [2019-12-26 23:06:57,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:06:57,834 INFO L93 Difference]: Finished difference Result 14471 states and 44955 transitions. [2019-12-26 23:06:57,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 23:06:57,834 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-26 23:06:57,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:06:57,887 INFO L225 Difference]: With dead ends: 14471 [2019-12-26 23:06:57,888 INFO L226 Difference]: Without dead ends: 14471 [2019-12-26 23:06:57,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:06:57,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14471 states. [2019-12-26 23:06:58,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14471 to 11360. [2019-12-26 23:06:58,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11360 states. [2019-12-26 23:06:58,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11360 states to 11360 states and 35793 transitions. [2019-12-26 23:06:58,327 INFO L78 Accepts]: Start accepts. Automaton has 11360 states and 35793 transitions. Word has length 14 [2019-12-26 23:06:58,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:06:58,330 INFO L462 AbstractCegarLoop]: Abstraction has 11360 states and 35793 transitions. [2019-12-26 23:06:58,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:06:58,330 INFO L276 IsEmpty]: Start isEmpty. Operand 11360 states and 35793 transitions. [2019-12-26 23:06:58,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 23:06:58,334 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:06:58,334 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:06:58,334 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:06:58,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:06:58,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1120571574, now seen corresponding path program 1 times [2019-12-26 23:06:58,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:06:58,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026212801] [2019-12-26 23:06:58,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:06:58,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:06:58,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:06:58,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026212801] [2019-12-26 23:06:58,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:06:58,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:06:58,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892192426] [2019-12-26 23:06:58,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:06:58,489 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:06:58,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:06:58,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:06:58,490 INFO L87 Difference]: Start difference. First operand 11360 states and 35793 transitions. Second operand 4 states. [2019-12-26 23:06:58,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:06:58,532 INFO L93 Difference]: Finished difference Result 2200 states and 5503 transitions. [2019-12-26 23:06:58,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 23:06:58,534 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-26 23:06:58,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:06:58,540 INFO L225 Difference]: With dead ends: 2200 [2019-12-26 23:06:58,541 INFO L226 Difference]: Without dead ends: 1563 [2019-12-26 23:06:58,541 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-26 23:06:58,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1563 states. [2019-12-26 23:06:58,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1563 to 1547. [2019-12-26 23:06:58,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-12-26 23:06:58,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 3457 transitions. [2019-12-26 23:06:58,646 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 3457 transitions. Word has length 16 [2019-12-26 23:06:58,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:06:58,647 INFO L462 AbstractCegarLoop]: Abstraction has 1547 states and 3457 transitions. [2019-12-26 23:06:58,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:06:58,647 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 3457 transitions. [2019-12-26 23:06:58,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-26 23:06:58,649 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:06:58,649 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:06:58,650 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:06:58,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:06:58,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1297290495, now seen corresponding path program 1 times [2019-12-26 23:06:58,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:06:58,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034522830] [2019-12-26 23:06:58,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:06:58,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:06:58,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:06:58,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034522830] [2019-12-26 23:06:58,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:06:58,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:06:58,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662395534] [2019-12-26 23:06:58,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:06:58,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:06:58,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:06:58,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:06:58,737 INFO L87 Difference]: Start difference. First operand 1547 states and 3457 transitions. Second operand 6 states. [2019-12-26 23:06:59,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:06:59,182 INFO L93 Difference]: Finished difference Result 2337 states and 5001 transitions. [2019-12-26 23:06:59,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-26 23:06:59,182 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-26 23:06:59,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:06:59,186 INFO L225 Difference]: With dead ends: 2337 [2019-12-26 23:06:59,187 INFO L226 Difference]: Without dead ends: 2285 [2019-12-26 23:06:59,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-26 23:06:59,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2285 states. [2019-12-26 23:06:59,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2285 to 1625. [2019-12-26 23:06:59,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1625 states. [2019-12-26 23:06:59,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1625 states to 1625 states and 3604 transitions. [2019-12-26 23:06:59,220 INFO L78 Accepts]: Start accepts. Automaton has 1625 states and 3604 transitions. Word has length 24 [2019-12-26 23:06:59,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:06:59,221 INFO L462 AbstractCegarLoop]: Abstraction has 1625 states and 3604 transitions. [2019-12-26 23:06:59,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:06:59,221 INFO L276 IsEmpty]: Start isEmpty. Operand 1625 states and 3604 transitions. [2019-12-26 23:06:59,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-26 23:06:59,223 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:06:59,224 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:06:59,224 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:06:59,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:06:59,224 INFO L82 PathProgramCache]: Analyzing trace with hash 2063536940, now seen corresponding path program 1 times [2019-12-26 23:06:59,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:06:59,225 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403355505] [2019-12-26 23:06:59,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:06:59,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:06:59,322 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-26 23:06:59,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403355505] [2019-12-26 23:06:59,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:06:59,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:06:59,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481110154] [2019-12-26 23:06:59,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:06:59,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:06:59,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:06:59,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:06:59,325 INFO L87 Difference]: Start difference. First operand 1625 states and 3604 transitions. Second operand 5 states. [2019-12-26 23:06:59,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:06:59,794 INFO L93 Difference]: Finished difference Result 2383 states and 5182 transitions. [2019-12-26 23:06:59,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 23:06:59,794 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-26 23:06:59,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:06:59,797 INFO L225 Difference]: With dead ends: 2383 [2019-12-26 23:06:59,798 INFO L226 Difference]: Without dead ends: 2383 [2019-12-26 23:06:59,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:06:59,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2383 states. [2019-12-26 23:06:59,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2383 to 2084. [2019-12-26 23:06:59,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2084 states. [2019-12-26 23:06:59,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2084 states to 2084 states and 4594 transitions. [2019-12-26 23:06:59,836 INFO L78 Accepts]: Start accepts. Automaton has 2084 states and 4594 transitions. Word has length 26 [2019-12-26 23:06:59,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:06:59,837 INFO L462 AbstractCegarLoop]: Abstraction has 2084 states and 4594 transitions. [2019-12-26 23:06:59,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:06:59,837 INFO L276 IsEmpty]: Start isEmpty. Operand 2084 states and 4594 transitions. [2019-12-26 23:06:59,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-26 23:06:59,840 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:06:59,840 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:06:59,841 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:06:59,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:06:59,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1394338791, now seen corresponding path program 1 times [2019-12-26 23:06:59,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:06:59,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748915704] [2019-12-26 23:06:59,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:06:59,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:06:59,928 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-26 23:06:59,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748915704] [2019-12-26 23:06:59,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:06:59,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:06:59,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361180659] [2019-12-26 23:06:59,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:06:59,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:06:59,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:06:59,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:06:59,931 INFO L87 Difference]: Start difference. First operand 2084 states and 4594 transitions. Second operand 5 states. [2019-12-26 23:06:59,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:06:59,974 INFO L93 Difference]: Finished difference Result 1286 states and 2707 transitions. [2019-12-26 23:06:59,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:06:59,975 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-26 23:06:59,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:06:59,977 INFO L225 Difference]: With dead ends: 1286 [2019-12-26 23:06:59,977 INFO L226 Difference]: Without dead ends: 1165 [2019-12-26 23:06:59,977 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:06:59,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2019-12-26 23:07:00,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 1076. [2019-12-26 23:07:00,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1076 states. [2019-12-26 23:07:00,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1076 states to 1076 states and 2287 transitions. [2019-12-26 23:07:00,017 INFO L78 Accepts]: Start accepts. Automaton has 1076 states and 2287 transitions. Word has length 27 [2019-12-26 23:07:00,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:07:00,018 INFO L462 AbstractCegarLoop]: Abstraction has 1076 states and 2287 transitions. [2019-12-26 23:07:00,018 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:07:00,019 INFO L276 IsEmpty]: Start isEmpty. Operand 1076 states and 2287 transitions. [2019-12-26 23:07:00,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-26 23:07:00,023 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:07:00,023 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:07:00,023 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:07:00,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:07:00,025 INFO L82 PathProgramCache]: Analyzing trace with hash -44666522, now seen corresponding path program 1 times [2019-12-26 23:07:00,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:07:00,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653543114] [2019-12-26 23:07:00,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:07:00,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:07:00,134 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-26 23:07:00,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653543114] [2019-12-26 23:07:00,135 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:07:00,135 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:07:00,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681458263] [2019-12-26 23:07:00,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:07:00,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:07:00,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:07:00,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:07:00,136 INFO L87 Difference]: Start difference. First operand 1076 states and 2287 transitions. Second operand 4 states. [2019-12-26 23:07:00,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:07:00,155 INFO L93 Difference]: Finished difference Result 1807 states and 3865 transitions. [2019-12-26 23:07:00,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 23:07:00,156 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-12-26 23:07:00,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:07:00,157 INFO L225 Difference]: With dead ends: 1807 [2019-12-26 23:07:00,157 INFO L226 Difference]: Without dead ends: 800 [2019-12-26 23:07:00,158 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-26 23:07:00,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2019-12-26 23:07:00,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 800. [2019-12-26 23:07:00,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2019-12-26 23:07:00,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1708 transitions. [2019-12-26 23:07:00,171 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1708 transitions. Word has length 50 [2019-12-26 23:07:00,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:07:00,171 INFO L462 AbstractCegarLoop]: Abstraction has 800 states and 1708 transitions. [2019-12-26 23:07:00,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:07:00,172 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1708 transitions. [2019-12-26 23:07:00,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-26 23:07:00,174 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:07:00,175 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:07:00,175 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:07:00,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:07:00,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1290466760, now seen corresponding path program 2 times [2019-12-26 23:07:00,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:07:00,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975810298] [2019-12-26 23:07:00,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:07:00,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:07:00,289 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-26 23:07:00,289 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975810298] [2019-12-26 23:07:00,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:07:00,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:07:00,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547830462] [2019-12-26 23:07:00,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:07:00,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:07:00,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:07:00,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:07:00,291 INFO L87 Difference]: Start difference. First operand 800 states and 1708 transitions. Second operand 7 states. [2019-12-26 23:07:00,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:07:00,492 INFO L93 Difference]: Finished difference Result 1394 states and 2892 transitions. [2019-12-26 23:07:00,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-26 23:07:00,492 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2019-12-26 23:07:00,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:07:00,494 INFO L225 Difference]: With dead ends: 1394 [2019-12-26 23:07:00,494 INFO L226 Difference]: Without dead ends: 931 [2019-12-26 23:07:00,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-26 23:07:00,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2019-12-26 23:07:00,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 792. [2019-12-26 23:07:00,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2019-12-26 23:07:00,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 1676 transitions. [2019-12-26 23:07:00,508 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 1676 transitions. Word has length 50 [2019-12-26 23:07:00,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:07:00,508 INFO L462 AbstractCegarLoop]: Abstraction has 792 states and 1676 transitions. [2019-12-26 23:07:00,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:07:00,509 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1676 transitions. [2019-12-26 23:07:00,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-26 23:07:00,511 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:07:00,511 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:07:00,512 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:07:00,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:07:00,512 INFO L82 PathProgramCache]: Analyzing trace with hash 50774886, now seen corresponding path program 3 times [2019-12-26 23:07:00,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:07:00,513 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283564694] [2019-12-26 23:07:00,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:07:00,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:07:00,593 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-26 23:07:00,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283564694] [2019-12-26 23:07:00,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:07:00,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:07:00,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427423326] [2019-12-26 23:07:00,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:07:00,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:07:00,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:07:00,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:07:00,597 INFO L87 Difference]: Start difference. First operand 792 states and 1676 transitions. Second operand 3 states. [2019-12-26 23:07:00,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:07:00,648 INFO L93 Difference]: Finished difference Result 1051 states and 2216 transitions. [2019-12-26 23:07:00,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:07:00,648 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-12-26 23:07:00,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:07:00,650 INFO L225 Difference]: With dead ends: 1051 [2019-12-26 23:07:00,650 INFO L226 Difference]: Without dead ends: 1051 [2019-12-26 23:07:00,651 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:07:00,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2019-12-26 23:07:00,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 849. [2019-12-26 23:07:00,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 849 states. [2019-12-26 23:07:00,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 1815 transitions. [2019-12-26 23:07:00,664 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 1815 transitions. Word has length 50 [2019-12-26 23:07:00,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:07:00,664 INFO L462 AbstractCegarLoop]: Abstraction has 849 states and 1815 transitions. [2019-12-26 23:07:00,665 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:07:00,665 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1815 transitions. [2019-12-26 23:07:00,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-26 23:07:00,668 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:07:00,668 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:07:00,668 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:07:00,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:07:00,668 INFO L82 PathProgramCache]: Analyzing trace with hash 925752847, now seen corresponding path program 1 times [2019-12-26 23:07:00,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:07:00,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909262203] [2019-12-26 23:07:00,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:07:00,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:07:00,764 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-26 23:07:00,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909262203] [2019-12-26 23:07:00,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:07:00,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:07:00,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895489593] [2019-12-26 23:07:00,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:07:00,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:07:00,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:07:00,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:07:00,767 INFO L87 Difference]: Start difference. First operand 849 states and 1815 transitions. Second operand 6 states. [2019-12-26 23:07:01,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:07:01,237 INFO L93 Difference]: Finished difference Result 1004 states and 2107 transitions. [2019-12-26 23:07:01,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 23:07:01,242 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-12-26 23:07:01,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:07:01,244 INFO L225 Difference]: With dead ends: 1004 [2019-12-26 23:07:01,244 INFO L226 Difference]: Without dead ends: 1004 [2019-12-26 23:07:01,244 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-26 23:07:01,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1004 states. [2019-12-26 23:07:01,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1004 to 909. [2019-12-26 23:07:01,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-12-26 23:07:01,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1931 transitions. [2019-12-26 23:07:01,261 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1931 transitions. Word has length 51 [2019-12-26 23:07:01,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:07:01,261 INFO L462 AbstractCegarLoop]: Abstraction has 909 states and 1931 transitions. [2019-12-26 23:07:01,261 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:07:01,262 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1931 transitions. [2019-12-26 23:07:01,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-26 23:07:01,264 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:07:01,265 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:07:01,265 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:07:01,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:07:01,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1086861075, now seen corresponding path program 2 times [2019-12-26 23:07:01,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:07:01,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771062321] [2019-12-26 23:07:01,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:07:01,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:07:01,345 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-26 23:07:01,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771062321] [2019-12-26 23:07:01,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:07:01,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:07:01,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487097448] [2019-12-26 23:07:01,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:07:01,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:07:01,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:07:01,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:07:01,347 INFO L87 Difference]: Start difference. First operand 909 states and 1931 transitions. Second operand 3 states. [2019-12-26 23:07:01,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:07:01,361 INFO L93 Difference]: Finished difference Result 908 states and 1929 transitions. [2019-12-26 23:07:01,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:07:01,362 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-26 23:07:01,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:07:01,363 INFO L225 Difference]: With dead ends: 908 [2019-12-26 23:07:01,363 INFO L226 Difference]: Without dead ends: 908 [2019-12-26 23:07:01,364 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-26 23:07:01,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2019-12-26 23:07:01,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 754. [2019-12-26 23:07:01,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2019-12-26 23:07:01,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1638 transitions. [2019-12-26 23:07:01,377 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1638 transitions. Word has length 51 [2019-12-26 23:07:01,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:07:01,377 INFO L462 AbstractCegarLoop]: Abstraction has 754 states and 1638 transitions. [2019-12-26 23:07:01,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:07:01,378 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1638 transitions. [2019-12-26 23:07:01,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-26 23:07:01,381 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:07:01,382 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:07:01,382 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:07:01,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:07:01,382 INFO L82 PathProgramCache]: Analyzing trace with hash 482770276, now seen corresponding path program 1 times [2019-12-26 23:07:01,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:07:01,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287369845] [2019-12-26 23:07:01,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:07:01,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:07:01,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:07:01,560 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 23:07:01,560 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 23:07:01,564 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] ULTIMATE.startENTRY-->L794: Formula: (let ((.cse0 (store |v_#valid_67| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~y$w_buff0~0_235) (= 0 v_~__unbuffered_cnt~0_55) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1559~0.base_40| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1559~0.base_40|) |v_ULTIMATE.start_main_~#t1559~0.offset_27| 0)) |v_#memory_int_17|) (= 0 v_~y$flush_delayed~0_22) (= |v_#NULL.offset_6| 0) (= v_~main$tmp_guard0~0_29 0) (= v_~y$r_buff0_thd1~0_177 0) (= v_~y$r_buff1_thd0~0_125 0) (= 0 v_~y$r_buff0_thd2~0_324) (= 0 v_~__unbuffered_p1_EAX~0_51) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1559~0.base_40|) (= v_~y$read_delayed~0_6 0) (= 0 v_~y$r_buff1_thd2~0_235) (= v_~y$w_buff1~0_162 0) (< 0 |v_#StackHeapBarrier_14|) (= v_~y$mem_tmp~0_15 0) (= 0 |v_#NULL.base_6|) (= v_~y$w_buff0_used~0_632 0) (= 0 v_~weak$$choice2~0_96) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1559~0.base_40|)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1559~0.base_40| 4)) (= v_~y~0_133 0) (= 0 v_~__unbuffered_p0_EAX~0_91) (= |v_ULTIMATE.start_main_~#t1559~0.offset_27| 0) (= v_~y$r_buff0_thd0~0_125 0) (= v_~y$w_buff1_used~0_311 0) (= v_~x~0_65 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= 0 v_~weak$$choice0~0_13) (= |v_#valid_65| (store .cse0 |v_ULTIMATE.start_main_~#t1559~0.base_40| 1)) (= v_~y$r_buff1_thd1~0_115 0) (= v_~main$tmp_guard1~0_37 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_67|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1560~0.offset=|v_ULTIMATE.start_main_~#t1560~0.offset_27|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_632, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_37, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_26|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_430|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_76|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_40|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_115, ~y$mem_tmp~0=v_~y$mem_tmp~0_15, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_91, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_51, ULTIMATE.start_main_~#t1560~0.base=|v_ULTIMATE.start_main_~#t1560~0.base_41|, ~y$w_buff0~0=v_~y$w_buff0~0_235, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_177, ~y$flush_delayed~0=v_~y$flush_delayed~0_22, ULTIMATE.start_main_~#t1559~0.base=|v_ULTIMATE.start_main_~#t1559~0.base_40|, #length=|v_#length_17|, ~y~0=v_~y~0_133, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_235, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_89|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_62|, ~y$w_buff1~0=v_~y$w_buff1~0_162, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_27|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_125, #valid=|v_#valid_65|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_324, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_15|, ULTIMATE.start_main_~#t1559~0.offset=|v_ULTIMATE.start_main_~#t1559~0.offset_27|, ~weak$$choice2~0=v_~weak$$choice2~0_96, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_125, ~x~0=v_~x~0_65, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_311} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1560~0.offset, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t1560~0.base, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ULTIMATE.start_main_~#t1559~0.base, #length, ~y~0, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t1559~0.offset, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-26 23:07:01,566 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L794-1-->L796: Formula: (and (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t1560~0.base_13| 4) |v_#length_11|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1560~0.base_13|) (= 0 |v_ULTIMATE.start_main_~#t1560~0.offset_11|) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1560~0.base_13|) 0) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1560~0.base_13| 1)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1560~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1560~0.base_13|) |v_ULTIMATE.start_main_~#t1560~0.offset_11| 1)) |v_#memory_int_11|) (not (= |v_ULTIMATE.start_main_~#t1560~0.base_13| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~#t1560~0.offset=|v_ULTIMATE.start_main_~#t1560~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t1560~0.base=|v_ULTIMATE.start_main_~#t1560~0.base_13|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1560~0.offset, ULTIMATE.start_main_~#t1560~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-26 23:07:01,566 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L4-->L738: Formula: (and (= ~y$r_buff0_thd1~0_Out-593974039 1) (= ~y$r_buff1_thd0~0_Out-593974039 ~y$r_buff0_thd0~0_In-593974039) (= ~y$r_buff0_thd2~0_In-593974039 ~y$r_buff1_thd2~0_Out-593974039) (not (= P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-593974039 0)) (= ~__unbuffered_p0_EAX~0_Out-593974039 ~x~0_In-593974039) (= ~y$r_buff0_thd1~0_In-593974039 ~y$r_buff1_thd1~0_Out-593974039)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-593974039, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-593974039, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-593974039, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-593974039, ~x~0=~x~0_In-593974039} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-593974039, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-593974039, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out-593974039, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-593974039, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-593974039, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-593974039, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-593974039, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-593974039, ~x~0=~x~0_In-593974039} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p0_EAX~0, ~y$r_buff0_thd1~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-26 23:07:01,572 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L739-->L739-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In-85456487 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-85456487 256) 0))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-85456487| 0)) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out-85456487| ~y$w_buff0_used~0_In-85456487)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-85456487, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-85456487} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-85456487|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-85456487, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-85456487} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-26 23:07:01,576 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L762-->L762-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1989779261 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite21_Out1989779261| ~y$w_buff0_used~0_In1989779261) (= |P1Thread1of1ForFork1_#t~ite20_In1989779261| |P1Thread1of1ForFork1_#t~ite20_Out1989779261|) (not .cse0)) (and .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In1989779261 256) 0))) (or (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1989779261 256))) (= 0 (mod ~y$w_buff0_used~0_In1989779261 256)) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In1989779261 256))))) (= |P1Thread1of1ForFork1_#t~ite20_Out1989779261| ~y$w_buff0_used~0_In1989779261) (= |P1Thread1of1ForFork1_#t~ite20_Out1989779261| |P1Thread1of1ForFork1_#t~ite21_Out1989779261|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1989779261, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1989779261, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In1989779261|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1989779261, ~weak$$choice2~0=~weak$$choice2~0_In1989779261, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1989779261} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1989779261, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1989779261, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out1989779261|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1989779261, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out1989779261|, ~weak$$choice2~0=~weak$$choice2~0_In1989779261, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1989779261} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-26 23:07:01,577 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L763-->L763-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1822950574 256))) (.cse4 (= (mod ~y$r_buff1_thd2~0_In1822950574 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In1822950574 256))) (.cse5 (= 0 (mod ~y$w_buff0_used~0_In1822950574 256))) (.cse1 (= |P1Thread1of1ForFork1_#t~ite23_Out1822950574| |P1Thread1of1ForFork1_#t~ite24_Out1822950574|)) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In1822950574 256)))) (or (and (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite23_Out1822950574| |P1Thread1of1ForFork1_#t~ite23_In1822950574|) (= |P1Thread1of1ForFork1_#t~ite24_Out1822950574| ~y$w_buff1_used~0_In1822950574)) (and .cse0 (= |P1Thread1of1ForFork1_#t~ite23_Out1822950574| ~y$w_buff1_used~0_In1822950574) .cse1 (or (and .cse2 .cse3) (and .cse4 .cse2) .cse5))) (= |P1Thread1of1ForFork1_#t~ite22_In1822950574| |P1Thread1of1ForFork1_#t~ite22_Out1822950574|)) (let ((.cse6 (not .cse2))) (and .cse0 (= 0 |P1Thread1of1ForFork1_#t~ite22_Out1822950574|) (= |P1Thread1of1ForFork1_#t~ite23_Out1822950574| |P1Thread1of1ForFork1_#t~ite22_Out1822950574|) (or .cse6 (not .cse4)) (or .cse6 (not .cse3)) (not .cse5) .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1822950574, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1822950574, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1822950574, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In1822950574|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In1822950574|, ~weak$$choice2~0=~weak$$choice2~0_In1822950574, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1822950574} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1822950574, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1822950574, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1822950574, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out1822950574|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out1822950574|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out1822950574|, ~weak$$choice2~0=~weak$$choice2~0_In1822950574, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1822950574} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-26 23:07:01,579 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L740-->L740-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd1~0_In1693434597 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1693434597 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In1693434597 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1693434597 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out1693434597|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~y$w_buff1_used~0_In1693434597 |P0Thread1of1ForFork0_#t~ite6_Out1693434597|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1693434597, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1693434597, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1693434597, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1693434597} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1693434597|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1693434597, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1693434597, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1693434597, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1693434597} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-26 23:07:01,580 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In1059114475 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1059114475 256)))) (or (and (not .cse0) (= 0 ~y$r_buff0_thd1~0_Out1059114475) (not .cse1)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd1~0_Out1059114475 ~y$r_buff0_thd1~0_In1059114475)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1059114475, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1059114475} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1059114475, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1059114475|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out1059114475} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 23:07:01,580 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L742-->L742-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In307773072 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd1~0_In307773072 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In307773072 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In307773072 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out307773072|)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd1~0_In307773072 |P0Thread1of1ForFork0_#t~ite8_Out307773072|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In307773072, ~y$w_buff0_used~0=~y$w_buff0_used~0_In307773072, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In307773072, ~y$w_buff1_used~0=~y$w_buff1_used~0_In307773072} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In307773072, ~y$w_buff0_used~0=~y$w_buff0_used~0_In307773072, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out307773072|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In307773072, ~y$w_buff1_used~0=~y$w_buff1_used~0_In307773072} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-26 23:07:01,580 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L763-8-->L765: Formula: (and (= v_~y$w_buff1_used~0_299 |v_P1Thread1of1ForFork1_#t~ite24_29|) (= v_~y$r_buff0_thd2~0_309 v_~y$r_buff0_thd2~0_310) (not (= (mod v_~weak$$choice2~0_88 256) 0))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_310, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_29|, ~weak$$choice2~0=v_~weak$$choice2~0_88} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_309, P1Thread1of1ForFork1_#t~ite23=|v_P1Thread1of1ForFork1_#t~ite23_28|, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_28|, P1Thread1of1ForFork1_#t~ite22=|v_P1Thread1of1ForFork1_#t~ite22_24|, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_29|, ~weak$$choice2~0=v_~weak$$choice2~0_88, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_31|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_34|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_299} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-26 23:07:01,580 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L765-->L765-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1505682697 256) 0))) (or (and .cse0 (= |P1Thread1of1ForFork1_#t~ite29_Out-1505682697| |P1Thread1of1ForFork1_#t~ite30_Out-1505682697|) (= |P1Thread1of1ForFork1_#t~ite29_Out-1505682697| ~y$r_buff1_thd2~0_In-1505682697) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1505682697 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In-1505682697 256)) (and (= (mod ~y$r_buff1_thd2~0_In-1505682697 256) 0) .cse1) (and .cse1 (= (mod ~y$w_buff1_used~0_In-1505682697 256) 0))))) (and (= ~y$r_buff1_thd2~0_In-1505682697 |P1Thread1of1ForFork1_#t~ite30_Out-1505682697|) (= |P1Thread1of1ForFork1_#t~ite29_In-1505682697| |P1Thread1of1ForFork1_#t~ite29_Out-1505682697|) (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1505682697, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-1505682697|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1505682697, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1505682697, ~weak$$choice2~0=~weak$$choice2~0_In-1505682697, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1505682697} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1505682697, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-1505682697|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-1505682697|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1505682697, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1505682697, ~weak$$choice2~0=~weak$$choice2~0_In-1505682697, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1505682697} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-26 23:07:01,581 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L767-->L771: Formula: (and (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= v_~y~0_25 v_~y$mem_tmp~0_5) (= 0 v_~y$flush_delayed~0_7)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_8} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~y~0=v_~y~0_25} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-26 23:07:01,582 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L771-2-->L771-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In1005692537 256))) (.cse0 (= (mod ~y$r_buff1_thd2~0_In1005692537 256) 0))) (or (and (= ~y~0_In1005692537 |P1Thread1of1ForFork1_#t~ite32_Out1005692537|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= ~y$w_buff1~0_In1005692537 |P1Thread1of1ForFork1_#t~ite32_Out1005692537|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1005692537, ~y$w_buff1~0=~y$w_buff1~0_In1005692537, ~y~0=~y~0_In1005692537, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1005692537} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1005692537, ~y$w_buff1~0=~y$w_buff1~0_In1005692537, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out1005692537|, ~y~0=~y~0_In1005692537, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1005692537} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-26 23:07:01,582 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L771-4-->L772: Formula: (= v_~y~0_18 |v_P1Thread1of1ForFork1_#t~ite32_10|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_10|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_9|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_13|, ~y~0=v_~y~0_18} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-12-26 23:07:01,583 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L772-->L772-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1383415854 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1383415854 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite34_Out1383415854| ~y$w_buff0_used~0_In1383415854) (or .cse0 .cse1)) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite34_Out1383415854| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1383415854, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1383415854} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1383415854, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1383415854, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out1383415854|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-26 23:07:01,585 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L773-->L773-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In-1452591431 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In-1452591431 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1452591431 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-1452591431 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-1452591431 |P1Thread1of1ForFork1_#t~ite35_Out-1452591431|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P1Thread1of1ForFork1_#t~ite35_Out-1452591431|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1452591431, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1452591431, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1452591431, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1452591431} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1452591431, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1452591431, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1452591431, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-1452591431|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1452591431} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-26 23:07:01,586 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L774-->L774-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1939925514 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1939925514 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite36_Out-1939925514| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite36_Out-1939925514| ~y$r_buff0_thd2~0_In-1939925514)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1939925514, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1939925514} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1939925514, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1939925514, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-1939925514|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-26 23:07:01,587 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L775-->L775-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In786691114 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In786691114 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd2~0_In786691114 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In786691114 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite37_Out786691114| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$r_buff1_thd2~0_In786691114 |P1Thread1of1ForFork1_#t~ite37_Out786691114|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In786691114, ~y$w_buff0_used~0=~y$w_buff0_used~0_In786691114, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In786691114, ~y$w_buff1_used~0=~y$w_buff1_used~0_In786691114} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In786691114, ~y$w_buff0_used~0=~y$w_buff0_used~0_In786691114, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In786691114, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out786691114|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In786691114} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-26 23:07:01,587 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L775-2-->P1EXIT: Formula: (and (= v_~y$r_buff1_thd2~0_106 |v_P1Thread1of1ForFork1_#t~ite37_28|) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_30 (+ v_~__unbuffered_cnt~0_31 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_28|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_106, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_27|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-26 23:07:01,587 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L742-2-->P0EXIT: Formula: (and (= v_~y$r_buff1_thd1~0_69 |v_P0Thread1of1ForFork0_#t~ite8_30|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_43 1) v_~__unbuffered_cnt~0_42) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_69, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_29|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-26 23:07:01,588 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L800-->L802-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_38 256)) (= (mod v_~y$w_buff0_used~0_265 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-26 23:07:01,589 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L802-2-->L802-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In196931732 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In196931732 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite40_Out196931732| ~y$w_buff1~0_In196931732)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite40_Out196931732| ~y~0_In196931732)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In196931732, ~y~0=~y~0_In196931732, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In196931732, ~y$w_buff1_used~0=~y$w_buff1_used~0_In196931732} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out196931732|, ~y$w_buff1~0=~y$w_buff1~0_In196931732, ~y~0=~y~0_In196931732, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In196931732, ~y$w_buff1_used~0=~y$w_buff1_used~0_In196931732} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-26 23:07:01,589 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L802-4-->L803: Formula: (= v_~y~0_51 |v_ULTIMATE.start_main_#t~ite40_24|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_24|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_23|, ~y~0=v_~y~0_51} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-26 23:07:01,589 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L803-->L803-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In546651721 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In546651721 256)))) (or (and (= |ULTIMATE.start_main_#t~ite42_Out546651721| 0) (not .cse0) (not .cse1)) (and (= ~y$w_buff0_used~0_In546651721 |ULTIMATE.start_main_#t~ite42_Out546651721|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In546651721, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In546651721} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In546651721, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In546651721, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out546651721|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-26 23:07:01,590 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L804-->L804-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd0~0_In271138893 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In271138893 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In271138893 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In271138893 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In271138893 |ULTIMATE.start_main_#t~ite43_Out271138893|)) (and (= |ULTIMATE.start_main_#t~ite43_Out271138893| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In271138893, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In271138893, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In271138893, ~y$w_buff1_used~0=~y$w_buff1_used~0_In271138893} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In271138893, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In271138893, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out271138893|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In271138893, ~y$w_buff1_used~0=~y$w_buff1_used~0_In271138893} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-26 23:07:01,591 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L805-->L805-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-540130551 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-540130551 256)))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out-540130551| ~y$r_buff0_thd0~0_In-540130551) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite44_Out-540130551| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-540130551, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-540130551} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-540130551, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-540130551, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-540130551|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-26 23:07:01,592 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L806-->L806-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-416763661 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-416763661 256))) (.cse2 (= (mod ~y$r_buff0_thd0~0_In-416763661 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-416763661 256)))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out-416763661| ~y$r_buff1_thd0~0_In-416763661) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite45_Out-416763661| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-416763661, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-416763661, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-416763661, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-416763661} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-416763661, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-416763661, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-416763661, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-416763661|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-416763661} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-26 23:07:01,593 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L806-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start_main_#t~ite45_31| v_~y$r_buff1_thd0~0_77) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= v_~main$tmp_guard1~0_13 0) (= (mod v_~main$tmp_guard1~0_13 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= 0 v_~__unbuffered_p1_EAX~0_19) (= 0 v_~__unbuffered_p0_EAX~0_47)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_47, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_19, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_31|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_47, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_19, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_77, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_30|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 23:07:01,720 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 11:07:01 BasicIcfg [2019-12-26 23:07:01,720 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 23:07:01,723 INFO L168 Benchmark]: Toolchain (without parser) took 14550.92 ms. Allocated memory was 144.2 MB in the beginning and 573.0 MB in the end (delta: 428.9 MB). Free memory was 99.0 MB in the beginning and 254.1 MB in the end (delta: -155.1 MB). Peak memory consumption was 273.8 MB. Max. memory is 7.1 GB. [2019-12-26 23:07:01,724 INFO L168 Benchmark]: CDTParser took 1.37 ms. Allocated memory is still 144.2 MB. Free memory was 119.3 MB in the beginning and 119.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-26 23:07:01,725 INFO L168 Benchmark]: CACSL2BoogieTranslator took 752.67 ms. Allocated memory was 144.2 MB in the beginning and 202.4 MB in the end (delta: 58.2 MB). Free memory was 98.8 MB in the beginning and 156.9 MB in the end (delta: -58.1 MB). Peak memory consumption was 20.3 MB. Max. memory is 7.1 GB. [2019-12-26 23:07:01,726 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.07 ms. Allocated memory is still 202.4 MB. Free memory was 156.9 MB in the beginning and 154.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-26 23:07:01,727 INFO L168 Benchmark]: Boogie Preprocessor took 37.10 ms. Allocated memory is still 202.4 MB. Free memory was 154.1 MB in the beginning and 152.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-26 23:07:01,728 INFO L168 Benchmark]: RCFGBuilder took 746.47 ms. Allocated memory is still 202.4 MB. Free memory was 152.1 MB in the beginning and 107.6 MB in the end (delta: 44.5 MB). Peak memory consumption was 44.5 MB. Max. memory is 7.1 GB. [2019-12-26 23:07:01,729 INFO L168 Benchmark]: TraceAbstraction took 12947.10 ms. Allocated memory was 202.4 MB in the beginning and 573.0 MB in the end (delta: 370.7 MB). Free memory was 106.9 MB in the beginning and 254.1 MB in the end (delta: -147.2 MB). Peak memory consumption was 223.5 MB. Max. memory is 7.1 GB. [2019-12-26 23:07:01,733 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.37 ms. Allocated memory is still 144.2 MB. Free memory was 119.3 MB in the beginning and 119.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 752.67 ms. Allocated memory was 144.2 MB in the beginning and 202.4 MB in the end (delta: 58.2 MB). Free memory was 98.8 MB in the beginning and 156.9 MB in the end (delta: -58.1 MB). Peak memory consumption was 20.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.07 ms. Allocated memory is still 202.4 MB. Free memory was 156.9 MB in the beginning and 154.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.10 ms. Allocated memory is still 202.4 MB. Free memory was 154.1 MB in the beginning and 152.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 746.47 ms. Allocated memory is still 202.4 MB. Free memory was 152.1 MB in the beginning and 107.6 MB in the end (delta: 44.5 MB). Peak memory consumption was 44.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12947.10 ms. Allocated memory was 202.4 MB in the beginning and 573.0 MB in the end (delta: 370.7 MB). Free memory was 106.9 MB in the beginning and 254.1 MB in the end (delta: -147.2 MB). Peak memory consumption was 223.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.0s, 147 ProgramPointsBefore, 75 ProgramPointsAfterwards, 181 TransitionsBefore, 84 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 28 ChoiceCompositions, 4653 VarBasedMoverChecksPositive, 173 VarBasedMoverChecksNegative, 19 SemBasedMoverChecksPositive, 209 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.4s, 0 MoverChecksTotal, 49472 CheckedPairsTotal, 106 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L794] FCALL, FORK 0 pthread_create(&t1559, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L724] 1 y$w_buff1 = y$w_buff0 [L725] 1 y$w_buff0 = 1 [L726] 1 y$w_buff1_used = y$w_buff0_used [L727] 1 y$w_buff0_used = (_Bool)1 [L796] FCALL, FORK 0 pthread_create(&t1560, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 2 x = 1 [L755] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L756] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L757] 2 y$flush_delayed = weak$$choice2 [L758] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L759] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L760] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L760] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L761] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L761] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L762] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L739] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L740] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L765] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L766] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L771] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L798] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L804] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L805] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 12.5s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1504 SDtfs, 1603 SDslu, 2727 SDs, 0 SdLazy, 1672 SolverSat, 71 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 19 SyntacticMatches, 7 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11360occurred 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: 1.6s AutomataMinimizationTime, 12 MinimizatonAttempts, 5973 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 425 NumberOfCodeBlocks, 425 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 361 ConstructedInterpolants, 0 QuantifiedInterpolants, 41543 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...