/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi007_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 07:12:24,919 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 07:12:24,921 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 07:12:24,933 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 07:12:24,934 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 07:12:24,935 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 07:12:24,936 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 07:12:24,938 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 07:12:24,940 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 07:12:24,941 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 07:12:24,942 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 07:12:24,943 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 07:12:24,943 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 07:12:24,944 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 07:12:24,945 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 07:12:24,946 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 07:12:24,947 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 07:12:24,948 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 07:12:24,950 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 07:12:24,952 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 07:12:24,954 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 07:12:24,955 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 07:12:24,956 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 07:12:24,957 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 07:12:24,959 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 07:12:24,960 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 07:12:24,960 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 07:12:24,961 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 07:12:24,961 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 07:12:24,962 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 07:12:24,963 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 07:12:24,963 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 07:12:24,964 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 07:12:24,965 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 07:12:24,966 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 07:12:24,966 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 07:12:24,967 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 07:12:24,967 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 07:12:24,967 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 07:12:24,968 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 07:12:24,969 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 07:12:24,970 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-27 07:12:24,993 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 07:12:24,994 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 07:12:24,995 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 07:12:24,996 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 07:12:24,996 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 07:12:24,996 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 07:12:24,996 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 07:12:24,997 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 07:12:24,997 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 07:12:24,997 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 07:12:24,998 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 07:12:24,998 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 07:12:24,998 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 07:12:24,999 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 07:12:24,999 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 07:12:24,999 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 07:12:25,000 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 07:12:25,000 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 07:12:25,000 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 07:12:25,000 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 07:12:25,001 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 07:12:25,001 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 07:12:25,001 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 07:12:25,001 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 07:12:25,001 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 07:12:25,002 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 07:12:25,002 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 07:12:25,002 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 07:12:25,002 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 07:12:25,002 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 07:12:25,280 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 07:12:25,290 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 07:12:25,296 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 07:12:25,297 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 07:12:25,298 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 07:12:25,299 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi007_rmo.oepc.i [2019-12-27 07:12:25,379 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be5dbc13c/22ca893c13544a3cb34d8fa298a9f92f/FLAG4deacdd25 [2019-12-27 07:12:25,953 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 07:12:25,954 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi007_rmo.oepc.i [2019-12-27 07:12:25,969 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be5dbc13c/22ca893c13544a3cb34d8fa298a9f92f/FLAG4deacdd25 [2019-12-27 07:12:26,181 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be5dbc13c/22ca893c13544a3cb34d8fa298a9f92f [2019-12-27 07:12:26,190 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 07:12:26,192 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 07:12:26,193 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 07:12:26,194 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 07:12:26,200 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 07:12:26,202 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:12:26" (1/1) ... [2019-12-27 07:12:26,205 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e50f93c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:12:26, skipping insertion in model container [2019-12-27 07:12:26,205 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:12:26" (1/1) ... [2019-12-27 07:12:26,215 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 07:12:26,268 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 07:12:26,840 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 07:12:26,853 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 07:12:26,919 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 07:12:26,993 INFO L208 MainTranslator]: Completed translation [2019-12-27 07:12:26,993 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:12:26 WrapperNode [2019-12-27 07:12:26,993 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 07:12:26,994 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 07:12:26,994 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 07:12:26,995 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 07:12:27,004 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:12:26" (1/1) ... [2019-12-27 07:12:27,032 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:12:26" (1/1) ... [2019-12-27 07:12:27,070 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 07:12:27,070 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 07:12:27,071 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 07:12:27,071 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 07:12:27,081 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:12:26" (1/1) ... [2019-12-27 07:12:27,081 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:12:26" (1/1) ... [2019-12-27 07:12:27,085 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:12:26" (1/1) ... [2019-12-27 07:12:27,086 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:12:26" (1/1) ... [2019-12-27 07:12:27,095 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:12:26" (1/1) ... [2019-12-27 07:12:27,099 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:12:26" (1/1) ... [2019-12-27 07:12:27,102 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:12:26" (1/1) ... [2019-12-27 07:12:27,107 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 07:12:27,108 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 07:12:27,108 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 07:12:27,108 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 07:12:27,109 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:12:26" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 07:12:27,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 07:12:27,182 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 07:12:27,182 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 07:12:27,183 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 07:12:27,183 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 07:12:27,183 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 07:12:27,183 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 07:12:27,183 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 07:12:27,183 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 07:12:27,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 07:12:27,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 07:12:27,186 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 07:12:28,008 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 07:12:28,008 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 07:12:28,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:12:28 BoogieIcfgContainer [2019-12-27 07:12:28,010 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 07:12:28,011 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 07:12:28,011 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 07:12:28,014 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 07:12:28,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 07:12:26" (1/3) ... [2019-12-27 07:12:28,015 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56017124 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:12:28, skipping insertion in model container [2019-12-27 07:12:28,015 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:12:26" (2/3) ... [2019-12-27 07:12:28,016 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56017124 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:12:28, skipping insertion in model container [2019-12-27 07:12:28,016 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:12:28" (3/3) ... [2019-12-27 07:12:28,018 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi007_rmo.oepc.i [2019-12-27 07:12:28,027 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 07:12:28,027 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 07:12:28,035 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 07:12:28,036 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 07:12:28,073 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,073 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,074 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,074 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,074 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,075 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,075 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,085 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,085 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,117 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,118 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,118 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,118 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,119 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,119 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,119 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,119 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,119 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,120 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,120 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,127 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,146 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:28,163 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 07:12:28,184 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 07:12:28,185 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 07:12:28,185 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 07:12:28,185 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 07:12:28,185 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 07:12:28,185 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 07:12:28,185 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 07:12:28,185 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 07:12:28,203 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-27 07:12:28,205 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-27 07:12:28,295 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-27 07:12:28,295 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 07:12:28,312 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 341 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 07:12:28,337 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-27 07:12:28,384 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-27 07:12:28,384 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 07:12:28,391 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 341 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 07:12:28,408 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-27 07:12:28,409 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 07:12:31,424 WARN L192 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-27 07:12:31,549 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-27 07:12:31,625 INFO L206 etLargeBlockEncoding]: Checked pairs total: 50908 [2019-12-27 07:12:31,625 INFO L214 etLargeBlockEncoding]: Total number of compositions: 100 [2019-12-27 07:12:31,629 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 80 places, 90 transitions [2019-12-27 07:12:32,154 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 9707 states. [2019-12-27 07:12:32,156 INFO L276 IsEmpty]: Start isEmpty. Operand 9707 states. [2019-12-27 07:12:32,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 07:12:32,163 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:12:32,164 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 07:12:32,164 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:12:32,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:12:32,171 INFO L82 PathProgramCache]: Analyzing trace with hash 787412, now seen corresponding path program 1 times [2019-12-27 07:12:32,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:12:32,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174768659] [2019-12-27 07:12:32,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:12:32,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:12:32,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:12:32,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174768659] [2019-12-27 07:12:32,394 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:12:32,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 07:12:32,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616170822] [2019-12-27 07:12:32,401 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:12:32,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:12:32,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:12:32,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:12:32,420 INFO L87 Difference]: Start difference. First operand 9707 states. Second operand 3 states. [2019-12-27 07:12:32,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:12:32,792 INFO L93 Difference]: Finished difference Result 9421 states and 30351 transitions. [2019-12-27 07:12:32,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:12:32,794 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 07:12:32,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:12:32,930 INFO L225 Difference]: With dead ends: 9421 [2019-12-27 07:12:32,934 INFO L226 Difference]: Without dead ends: 8862 [2019-12-27 07:12:32,936 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:12:33,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8862 states. [2019-12-27 07:12:33,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8862 to 8862. [2019-12-27 07:12:33,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8862 states. [2019-12-27 07:12:33,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8862 states to 8862 states and 28501 transitions. [2019-12-27 07:12:33,466 INFO L78 Accepts]: Start accepts. Automaton has 8862 states and 28501 transitions. Word has length 3 [2019-12-27 07:12:33,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:12:33,467 INFO L462 AbstractCegarLoop]: Abstraction has 8862 states and 28501 transitions. [2019-12-27 07:12:33,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:12:33,467 INFO L276 IsEmpty]: Start isEmpty. Operand 8862 states and 28501 transitions. [2019-12-27 07:12:33,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 07:12:33,470 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:12:33,471 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:12:33,471 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:12:33,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:12:33,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1755658876, now seen corresponding path program 1 times [2019-12-27 07:12:33,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:12:33,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051480567] [2019-12-27 07:12:33,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:12:33,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:12:33,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:12:33,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051480567] [2019-12-27 07:12:33,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:12:33,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:12:33,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168341109] [2019-12-27 07:12:33,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:12:33,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:12:33,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:12:33,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:12:33,601 INFO L87 Difference]: Start difference. First operand 8862 states and 28501 transitions. Second operand 4 states. [2019-12-27 07:12:34,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:12:34,224 INFO L93 Difference]: Finished difference Result 13396 states and 41079 transitions. [2019-12-27 07:12:34,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:12:34,225 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 07:12:34,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:12:34,299 INFO L225 Difference]: With dead ends: 13396 [2019-12-27 07:12:34,299 INFO L226 Difference]: Without dead ends: 13389 [2019-12-27 07:12:34,300 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:12:34,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13389 states. [2019-12-27 07:12:34,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13389 to 12015. [2019-12-27 07:12:34,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12015 states. [2019-12-27 07:12:35,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12015 states to 12015 states and 37536 transitions. [2019-12-27 07:12:35,456 INFO L78 Accepts]: Start accepts. Automaton has 12015 states and 37536 transitions. Word has length 11 [2019-12-27 07:12:35,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:12:35,457 INFO L462 AbstractCegarLoop]: Abstraction has 12015 states and 37536 transitions. [2019-12-27 07:12:35,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:12:35,457 INFO L276 IsEmpty]: Start isEmpty. Operand 12015 states and 37536 transitions. [2019-12-27 07:12:35,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 07:12:35,462 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:12:35,462 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:12:35,463 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:12:35,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:12:35,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1550555126, now seen corresponding path program 1 times [2019-12-27 07:12:35,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:12:35,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435600186] [2019-12-27 07:12:35,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:12:35,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:12:35,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:12:35,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435600186] [2019-12-27 07:12:35,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:12:35,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:12:35,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809695401] [2019-12-27 07:12:35,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:12:35,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:12:35,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:12:35,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:12:35,608 INFO L87 Difference]: Start difference. First operand 12015 states and 37536 transitions. Second operand 4 states. [2019-12-27 07:12:35,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:12:35,932 INFO L93 Difference]: Finished difference Result 14164 states and 44146 transitions. [2019-12-27 07:12:35,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:12:35,933 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 07:12:35,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:12:35,981 INFO L225 Difference]: With dead ends: 14164 [2019-12-27 07:12:35,982 INFO L226 Difference]: Without dead ends: 14164 [2019-12-27 07:12:35,982 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:12:36,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14164 states. [2019-12-27 07:12:36,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14164 to 12676. [2019-12-27 07:12:36,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12676 states. [2019-12-27 07:12:36,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12676 states to 12676 states and 39720 transitions. [2019-12-27 07:12:36,512 INFO L78 Accepts]: Start accepts. Automaton has 12676 states and 39720 transitions. Word has length 14 [2019-12-27 07:12:36,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:12:36,513 INFO L462 AbstractCegarLoop]: Abstraction has 12676 states and 39720 transitions. [2019-12-27 07:12:36,513 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:12:36,513 INFO L276 IsEmpty]: Start isEmpty. Operand 12676 states and 39720 transitions. [2019-12-27 07:12:36,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 07:12:36,517 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:12:36,517 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:12:36,517 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:12:36,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:12:36,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1838903681, now seen corresponding path program 1 times [2019-12-27 07:12:36,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:12:36,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610054603] [2019-12-27 07:12:36,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:12:36,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:12:36,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:12:36,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610054603] [2019-12-27 07:12:36,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:12:36,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 07:12:36,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140469392] [2019-12-27 07:12:36,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:12:36,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:12:36,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:12:36,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:12:36,587 INFO L87 Difference]: Start difference. First operand 12676 states and 39720 transitions. Second operand 3 states. [2019-12-27 07:12:36,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:12:36,659 INFO L93 Difference]: Finished difference Result 12673 states and 39711 transitions. [2019-12-27 07:12:36,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:12:36,660 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 07:12:36,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:12:36,706 INFO L225 Difference]: With dead ends: 12673 [2019-12-27 07:12:36,707 INFO L226 Difference]: Without dead ends: 12673 [2019-12-27 07:12:36,707 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:12:36,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12673 states. [2019-12-27 07:12:37,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12673 to 12673. [2019-12-27 07:12:37,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12673 states. [2019-12-27 07:12:37,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12673 states to 12673 states and 39711 transitions. [2019-12-27 07:12:37,113 INFO L78 Accepts]: Start accepts. Automaton has 12673 states and 39711 transitions. Word has length 16 [2019-12-27 07:12:37,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:12:37,113 INFO L462 AbstractCegarLoop]: Abstraction has 12673 states and 39711 transitions. [2019-12-27 07:12:37,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:12:37,113 INFO L276 IsEmpty]: Start isEmpty. Operand 12673 states and 39711 transitions. [2019-12-27 07:12:37,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 07:12:37,118 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:12:37,118 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:12:37,118 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:12:37,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:12:37,119 INFO L82 PathProgramCache]: Analyzing trace with hash -601685409, now seen corresponding path program 1 times [2019-12-27 07:12:37,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:12:37,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936595600] [2019-12-27 07:12:37,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:12:37,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:12:37,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:12:37,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936595600] [2019-12-27 07:12:37,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:12:37,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:12:37,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328407370] [2019-12-27 07:12:37,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:12:37,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:12:37,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:12:37,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:12:37,203 INFO L87 Difference]: Start difference. First operand 12673 states and 39711 transitions. Second operand 3 states. [2019-12-27 07:12:37,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:12:37,403 INFO L93 Difference]: Finished difference Result 21543 states and 67050 transitions. [2019-12-27 07:12:37,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:12:37,404 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-27 07:12:37,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:12:37,443 INFO L225 Difference]: With dead ends: 21543 [2019-12-27 07:12:37,443 INFO L226 Difference]: Without dead ends: 12171 [2019-12-27 07:12:37,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:12:37,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12171 states. [2019-12-27 07:12:37,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12171 to 11475. [2019-12-27 07:12:37,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11475 states. [2019-12-27 07:12:37,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11475 states to 11475 states and 34983 transitions. [2019-12-27 07:12:37,775 INFO L78 Accepts]: Start accepts. Automaton has 11475 states and 34983 transitions. Word has length 17 [2019-12-27 07:12:37,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:12:37,776 INFO L462 AbstractCegarLoop]: Abstraction has 11475 states and 34983 transitions. [2019-12-27 07:12:37,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:12:37,776 INFO L276 IsEmpty]: Start isEmpty. Operand 11475 states and 34983 transitions. [2019-12-27 07:12:37,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 07:12:37,780 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:12:37,781 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:12:37,781 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:12:37,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:12:37,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1176802527, now seen corresponding path program 1 times [2019-12-27 07:12:37,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:12:37,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540387392] [2019-12-27 07:12:37,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:12:37,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:12:37,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:12:37,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540387392] [2019-12-27 07:12:37,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:12:37,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:12:37,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581460399] [2019-12-27 07:12:37,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:12:37,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:12:37,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:12:37,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:12:37,834 INFO L87 Difference]: Start difference. First operand 11475 states and 34983 transitions. Second operand 3 states. [2019-12-27 07:12:37,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:12:37,889 INFO L93 Difference]: Finished difference Result 10927 states and 32734 transitions. [2019-12-27 07:12:37,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:12:37,890 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-27 07:12:37,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:12:37,919 INFO L225 Difference]: With dead ends: 10927 [2019-12-27 07:12:37,919 INFO L226 Difference]: Without dead ends: 10927 [2019-12-27 07:12:37,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:12:38,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10927 states. [2019-12-27 07:12:38,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10927 to 10919. [2019-12-27 07:12:38,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10919 states. [2019-12-27 07:12:38,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10919 states to 10919 states and 32718 transitions. [2019-12-27 07:12:38,344 INFO L78 Accepts]: Start accepts. Automaton has 10919 states and 32718 transitions. Word has length 17 [2019-12-27 07:12:38,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:12:38,345 INFO L462 AbstractCegarLoop]: Abstraction has 10919 states and 32718 transitions. [2019-12-27 07:12:38,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:12:38,345 INFO L276 IsEmpty]: Start isEmpty. Operand 10919 states and 32718 transitions. [2019-12-27 07:12:38,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 07:12:38,349 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:12:38,349 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:12:38,349 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:12:38,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:12:38,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1916399741, now seen corresponding path program 1 times [2019-12-27 07:12:38,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:12:38,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518964001] [2019-12-27 07:12:38,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:12:38,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:12:38,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:12:38,436 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518964001] [2019-12-27 07:12:38,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:12:38,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:12:38,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166417960] [2019-12-27 07:12:38,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:12:38,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:12:38,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:12:38,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:12:38,438 INFO L87 Difference]: Start difference. First operand 10919 states and 32718 transitions. Second operand 4 states. [2019-12-27 07:12:38,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:12:38,475 INFO L93 Difference]: Finished difference Result 1855 states and 4482 transitions. [2019-12-27 07:12:38,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 07:12:38,475 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-27 07:12:38,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:12:38,479 INFO L225 Difference]: With dead ends: 1855 [2019-12-27 07:12:38,479 INFO L226 Difference]: Without dead ends: 1321 [2019-12-27 07:12:38,479 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:12:38,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1321 states. [2019-12-27 07:12:38,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1321 to 1321. [2019-12-27 07:12:38,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1321 states. [2019-12-27 07:12:38,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1321 states and 2836 transitions. [2019-12-27 07:12:38,503 INFO L78 Accepts]: Start accepts. Automaton has 1321 states and 2836 transitions. Word has length 17 [2019-12-27 07:12:38,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:12:38,504 INFO L462 AbstractCegarLoop]: Abstraction has 1321 states and 2836 transitions. [2019-12-27 07:12:38,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:12:38,504 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 2836 transitions. [2019-12-27 07:12:38,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 07:12:38,506 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:12:38,506 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:12:38,506 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:12:38,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:12:38,507 INFO L82 PathProgramCache]: Analyzing trace with hash -2091906228, now seen corresponding path program 1 times [2019-12-27 07:12:38,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:12:38,507 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728902519] [2019-12-27 07:12:38,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:12:38,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:12:38,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:12:38,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728902519] [2019-12-27 07:12:38,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:12:38,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 07:12:38,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56319188] [2019-12-27 07:12:38,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 07:12:38,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:12:38,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 07:12:38,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:12:38,602 INFO L87 Difference]: Start difference. First operand 1321 states and 2836 transitions. Second operand 6 states. [2019-12-27 07:12:39,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:12:39,198 INFO L93 Difference]: Finished difference Result 3692 states and 7831 transitions. [2019-12-27 07:12:39,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 07:12:39,199 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-27 07:12:39,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:12:39,204 INFO L225 Difference]: With dead ends: 3692 [2019-12-27 07:12:39,204 INFO L226 Difference]: Without dead ends: 3657 [2019-12-27 07:12:39,204 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 07:12:39,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3657 states. [2019-12-27 07:12:39,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3657 to 1802. [2019-12-27 07:12:39,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1802 states. [2019-12-27 07:12:39,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1802 states to 1802 states and 3967 transitions. [2019-12-27 07:12:39,261 INFO L78 Accepts]: Start accepts. Automaton has 1802 states and 3967 transitions. Word has length 25 [2019-12-27 07:12:39,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:12:39,262 INFO L462 AbstractCegarLoop]: Abstraction has 1802 states and 3967 transitions. [2019-12-27 07:12:39,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 07:12:39,262 INFO L276 IsEmpty]: Start isEmpty. Operand 1802 states and 3967 transitions. [2019-12-27 07:12:39,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 07:12:39,266 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:12:39,266 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:12:39,266 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:12:39,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:12:39,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1541096581, now seen corresponding path program 1 times [2019-12-27 07:12:39,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:12:39,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492715076] [2019-12-27 07:12:39,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:12:39,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:12:39,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:12:39,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492715076] [2019-12-27 07:12:39,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:12:39,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 07:12:39,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674682255] [2019-12-27 07:12:39,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 07:12:39,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:12:39,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 07:12:39,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:12:39,356 INFO L87 Difference]: Start difference. First operand 1802 states and 3967 transitions. Second operand 6 states. [2019-12-27 07:12:39,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:12:39,756 INFO L93 Difference]: Finished difference Result 3339 states and 7076 transitions. [2019-12-27 07:12:39,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 07:12:39,757 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-12-27 07:12:39,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:12:39,761 INFO L225 Difference]: With dead ends: 3339 [2019-12-27 07:12:39,761 INFO L226 Difference]: Without dead ends: 3310 [2019-12-27 07:12:39,762 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 07:12:39,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3310 states. [2019-12-27 07:12:39,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3310 to 1781. [2019-12-27 07:12:39,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1781 states. [2019-12-27 07:12:39,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1781 states to 1781 states and 3928 transitions. [2019-12-27 07:12:39,803 INFO L78 Accepts]: Start accepts. Automaton has 1781 states and 3928 transitions. Word has length 26 [2019-12-27 07:12:39,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:12:39,803 INFO L462 AbstractCegarLoop]: Abstraction has 1781 states and 3928 transitions. [2019-12-27 07:12:39,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 07:12:39,803 INFO L276 IsEmpty]: Start isEmpty. Operand 1781 states and 3928 transitions. [2019-12-27 07:12:39,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 07:12:39,806 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:12:39,807 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:12:39,807 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:12:39,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:12:39,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1084312717, now seen corresponding path program 1 times [2019-12-27 07:12:39,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:12:39,808 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542597570] [2019-12-27 07:12:39,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:12:39,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:12:39,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:12:39,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542597570] [2019-12-27 07:12:39,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:12:39,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 07:12:39,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375519724] [2019-12-27 07:12:39,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:12:39,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:12:39,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:12:39,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:12:39,890 INFO L87 Difference]: Start difference. First operand 1781 states and 3928 transitions. Second operand 5 states. [2019-12-27 07:12:39,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:12:39,931 INFO L93 Difference]: Finished difference Result 916 states and 1977 transitions. [2019-12-27 07:12:39,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:12:39,932 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 07:12:39,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:12:39,933 INFO L225 Difference]: With dead ends: 916 [2019-12-27 07:12:39,933 INFO L226 Difference]: Without dead ends: 744 [2019-12-27 07:12:39,934 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-27 07:12:39,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2019-12-27 07:12:39,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 744. [2019-12-27 07:12:39,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 744 states. [2019-12-27 07:12:39,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 1655 transitions. [2019-12-27 07:12:39,945 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 1655 transitions. Word has length 28 [2019-12-27 07:12:39,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:12:39,946 INFO L462 AbstractCegarLoop]: Abstraction has 744 states and 1655 transitions. [2019-12-27 07:12:39,946 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:12:39,946 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 1655 transitions. [2019-12-27 07:12:39,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 07:12:39,949 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:12:39,949 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:12:39,949 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:12:39,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:12:39,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1928000048, now seen corresponding path program 1 times [2019-12-27 07:12:39,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:12:39,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553772375] [2019-12-27 07:12:39,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:12:39,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:12:40,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:12:40,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553772375] [2019-12-27 07:12:40,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:12:40,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 07:12:40,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967058985] [2019-12-27 07:12:40,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 07:12:40,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:12:40,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 07:12:40,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:12:40,066 INFO L87 Difference]: Start difference. First operand 744 states and 1655 transitions. Second operand 7 states. [2019-12-27 07:12:40,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:12:40,275 INFO L93 Difference]: Finished difference Result 1483 states and 3211 transitions. [2019-12-27 07:12:40,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 07:12:40,276 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-12-27 07:12:40,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:12:40,277 INFO L225 Difference]: With dead ends: 1483 [2019-12-27 07:12:40,277 INFO L226 Difference]: Without dead ends: 990 [2019-12-27 07:12:40,278 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-27 07:12:40,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2019-12-27 07:12:40,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 819. [2019-12-27 07:12:40,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 819 states. [2019-12-27 07:12:40,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1780 transitions. [2019-12-27 07:12:40,291 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1780 transitions. Word has length 52 [2019-12-27 07:12:40,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:12:40,292 INFO L462 AbstractCegarLoop]: Abstraction has 819 states and 1780 transitions. [2019-12-27 07:12:40,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 07:12:40,292 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1780 transitions. [2019-12-27 07:12:40,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 07:12:40,294 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:12:40,295 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:12:40,295 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:12:40,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:12:40,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1603502286, now seen corresponding path program 2 times [2019-12-27 07:12:40,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:12:40,296 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170708479] [2019-12-27 07:12:40,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:12:40,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:12:40,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:12:40,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170708479] [2019-12-27 07:12:40,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:12:40,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 07:12:40,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712642687] [2019-12-27 07:12:40,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:12:40,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:12:40,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:12:40,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:12:40,445 INFO L87 Difference]: Start difference. First operand 819 states and 1780 transitions. Second operand 5 states. [2019-12-27 07:12:40,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:12:40,866 INFO L93 Difference]: Finished difference Result 1344 states and 2855 transitions. [2019-12-27 07:12:40,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 07:12:40,866 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-12-27 07:12:40,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:12:40,868 INFO L225 Difference]: With dead ends: 1344 [2019-12-27 07:12:40,868 INFO L226 Difference]: Without dead ends: 1320 [2019-12-27 07:12:40,869 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-27 07:12:40,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1320 states. [2019-12-27 07:12:40,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1320 to 1031. [2019-12-27 07:12:40,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1031 states. [2019-12-27 07:12:40,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 1031 states and 2242 transitions. [2019-12-27 07:12:40,887 INFO L78 Accepts]: Start accepts. Automaton has 1031 states and 2242 transitions. Word has length 52 [2019-12-27 07:12:40,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:12:40,888 INFO L462 AbstractCegarLoop]: Abstraction has 1031 states and 2242 transitions. [2019-12-27 07:12:40,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:12:40,888 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 2242 transitions. [2019-12-27 07:12:40,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 07:12:40,891 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:12:40,891 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:12:40,891 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:12:40,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:12:40,892 INFO L82 PathProgramCache]: Analyzing trace with hash 936201678, now seen corresponding path program 3 times [2019-12-27 07:12:40,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:12:40,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243118284] [2019-12-27 07:12:40,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:12:40,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:12:41,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:12:41,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243118284] [2019-12-27 07:12:41,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:12:41,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:12:41,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632569776] [2019-12-27 07:12:41,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:12:41,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:12:41,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:12:41,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:12:41,003 INFO L87 Difference]: Start difference. First operand 1031 states and 2242 transitions. Second operand 3 states. [2019-12-27 07:12:41,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:12:41,062 INFO L93 Difference]: Finished difference Result 1274 states and 2751 transitions. [2019-12-27 07:12:41,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:12:41,063 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 07:12:41,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:12:41,065 INFO L225 Difference]: With dead ends: 1274 [2019-12-27 07:12:41,066 INFO L226 Difference]: Without dead ends: 1274 [2019-12-27 07:12:41,066 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-27 07:12:41,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1274 states. [2019-12-27 07:12:41,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1274 to 895. [2019-12-27 07:12:41,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2019-12-27 07:12:41,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1922 transitions. [2019-12-27 07:12:41,084 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1922 transitions. Word has length 52 [2019-12-27 07:12:41,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:12:41,084 INFO L462 AbstractCegarLoop]: Abstraction has 895 states and 1922 transitions. [2019-12-27 07:12:41,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:12:41,085 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1922 transitions. [2019-12-27 07:12:41,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 07:12:41,088 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:12:41,088 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:12:41,088 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:12:41,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:12:41,088 INFO L82 PathProgramCache]: Analyzing trace with hash -616115185, now seen corresponding path program 1 times [2019-12-27 07:12:41,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:12:41,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600981332] [2019-12-27 07:12:41,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:12:41,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 07:12:41,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 07:12:41,321 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 07:12:41,321 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 07:12:41,326 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] ULTIMATE.startENTRY-->L797: Formula: (let ((.cse0 (store |v_#valid_45| 0 0))) (and (= (select .cse0 |v_ULTIMATE.start_main_~#t1713~0.base_22|) 0) (= 0 v_~weak$$choice0~0_8) (= v_~main$tmp_guard1~0_16 0) (= 0 v_~__unbuffered_cnt~0_15) (= v_~main$tmp_guard0~0_9 0) (= 0 v_~x$w_buff1~0_25) (= 0 v_~__unbuffered_p1_EAX~0_12) (= |v_#NULL.offset_6| 0) (= 0 v_~x$r_buff0_thd1~0_28) (= 0 v_~x$r_buff0_thd0~0_22) (= 0 v_~x$r_buff0_thd2~0_76) (= v_~x~0_24 0) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1713~0.base_22| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1713~0.base_22|) |v_ULTIMATE.start_main_~#t1713~0.offset_17| 0)) |v_#memory_int_13|) (= v_~x$flush_delayed~0_13 0) (= v_~x$w_buff1_used~0_67 0) (= 0 v_~x$read_delayed_var~0.base_7) (= v_~x$r_buff1_thd1~0_18 0) (= 0 v_~x$w_buff0~0_25) (= v_~y~0_15 0) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice2~0_33) (= v_~x$r_buff1_thd2~0_51 0) (= 0 v_~x$read_delayed~0_7) (= v_~x$mem_tmp~0_10 0) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1713~0.base_22| 4)) (= 0 v_~x$w_buff0_used~0_102) (= 0 |v_ULTIMATE.start_main_~#t1713~0.offset_17|) (= 0 v_~x$read_delayed_var~0.offset_7) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1713~0.base_22|) (= v_~__unbuffered_p1_EBX~0_13 0) (= v_~x$r_buff1_thd0~0_19 0) (= |v_#valid_43| (store .cse0 |v_ULTIMATE.start_main_~#t1713~0.base_22| 1)) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_25, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_28, ULTIMATE.start_main_~#t1714~0.offset=|v_ULTIMATE.start_main_~#t1714~0.offset_14|, ~x$flush_delayed~0=v_~x$flush_delayed~0_13, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_18, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~x$mem_tmp~0=v_~x$mem_tmp~0_10, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_17|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_10|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_12, ULTIMATE.start_main_~#t1714~0.base=|v_ULTIMATE.start_main_~#t1714~0.base_16|, #length=|v_#length_13|, ~y~0=v_~y~0_15, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_22, ULTIMATE.start_main_~#t1713~0.base=|v_ULTIMATE.start_main_~#t1713~0.base_22|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_13, ~x$w_buff1~0=v_~x$w_buff1~0_25, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_67, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_51, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_19, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_76, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_102, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ULTIMATE.start_main_~#t1713~0.offset=|v_ULTIMATE.start_main_~#t1713~0.offset_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_7|, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~x~0=v_~x~0_24, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_~#t1714~0.offset, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t1714~0.base, #length, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_~#t1713~0.base, ~__unbuffered_p1_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t1713~0.offset, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 07:12:41,329 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L4-->L738: Formula: (and (= v_~x$r_buff1_thd2~0_33 v_~x$r_buff0_thd2~0_56) (= v_~x$r_buff1_thd1~0_11 v_~x$r_buff0_thd1~0_17) (= v_~x$r_buff1_thd0~0_11 v_~x$r_buff0_thd0~0_14) (= 1 v_~y~0_5) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6 0)) (= 1 v_~x$r_buff0_thd1~0_16)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_14, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_17, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_56} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_14, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_16, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_33, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_11, ~y~0=v_~y~0_5, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_56, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_11} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 07:12:41,330 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L797-1-->L799: Formula: (and (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1714~0.base_12|)) (= 0 |v_ULTIMATE.start_main_~#t1714~0.offset_10|) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1714~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1714~0.base_12|) |v_ULTIMATE.start_main_~#t1714~0.offset_10| 1)) |v_#memory_int_9|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1714~0.base_12|) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t1714~0.base_12| 4)) (not (= |v_ULTIMATE.start_main_~#t1714~0.base_12| 0)) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1714~0.base_12| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t1714~0.offset=|v_ULTIMATE.start_main_~#t1714~0.offset_10|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t1714~0.base=|v_ULTIMATE.start_main_~#t1714~0.base_12|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1714~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t1714~0.base, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-27 07:12:41,335 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L739-->L739-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-192704213 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd1~0_In-192704213 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out-192704213| 0) (not .cse1)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-192704213 |P0Thread1of1ForFork0_#t~ite5_Out-192704213|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-192704213, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-192704213} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-192704213|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-192704213, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-192704213} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 07:12:41,336 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L763-->L763-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-659169190 256) 0))) (or (and .cse0 (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In-659169190 256) 0))) (or (and (= (mod ~x$w_buff1_used~0_In-659169190 256) 0) .cse1) (and (= 0 (mod ~x$r_buff1_thd2~0_In-659169190 256)) .cse1) (= 0 (mod ~x$w_buff0_used~0_In-659169190 256)))) (= |P1Thread1of1ForFork1_#t~ite14_Out-659169190| ~x$w_buff0~0_In-659169190) (= |P1Thread1of1ForFork1_#t~ite14_Out-659169190| |P1Thread1of1ForFork1_#t~ite15_Out-659169190|)) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite14_In-659169190| |P1Thread1of1ForFork1_#t~ite14_Out-659169190|) (= |P1Thread1of1ForFork1_#t~ite15_Out-659169190| ~x$w_buff0~0_In-659169190)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-659169190, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-659169190, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-659169190, ~weak$$choice2~0=~weak$$choice2~0_In-659169190, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-659169190, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In-659169190|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-659169190} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-659169190, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-659169190, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-659169190, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out-659169190|, ~weak$$choice2~0=~weak$$choice2~0_In-659169190, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-659169190, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-659169190|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-659169190} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 07:12:41,338 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L764-->L764-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1303104891 256)))) (or (and .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-1303104891 256)))) (or (and .cse1 (= 0 (mod ~x$r_buff1_thd2~0_In-1303104891 256))) (= 0 (mod ~x$w_buff0_used~0_In-1303104891 256)) (and (= 0 (mod ~x$w_buff1_used~0_In-1303104891 256)) .cse1))) (= |P1Thread1of1ForFork1_#t~ite18_Out-1303104891| |P1Thread1of1ForFork1_#t~ite17_Out-1303104891|) (= ~x$w_buff1~0_In-1303104891 |P1Thread1of1ForFork1_#t~ite17_Out-1303104891|)) (and (= |P1Thread1of1ForFork1_#t~ite18_Out-1303104891| ~x$w_buff1~0_In-1303104891) (= |P1Thread1of1ForFork1_#t~ite17_In-1303104891| |P1Thread1of1ForFork1_#t~ite17_Out-1303104891|) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1303104891, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1303104891, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1303104891, ~weak$$choice2~0=~weak$$choice2~0_In-1303104891, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1303104891, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In-1303104891|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1303104891} OutVars{P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out-1303104891|, ~x$w_buff1~0=~x$w_buff1~0_In-1303104891, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1303104891, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1303104891, ~weak$$choice2~0=~weak$$choice2~0_In-1303104891, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1303104891, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out-1303104891|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1303104891} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-27 07:12:41,339 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L765-->L765-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In749460834 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite21_Out749460834| ~x$w_buff0_used~0_In749460834) (= |P1Thread1of1ForFork1_#t~ite20_In749460834| |P1Thread1of1ForFork1_#t~ite20_Out749460834|)) (and .cse0 (= |P1Thread1of1ForFork1_#t~ite21_Out749460834| |P1Thread1of1ForFork1_#t~ite20_Out749460834|) (= |P1Thread1of1ForFork1_#t~ite20_Out749460834| ~x$w_buff0_used~0_In749460834) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In749460834 256)))) (or (and (= 0 (mod ~x$w_buff1_used~0_In749460834 256)) .cse1) (= 0 (mod ~x$w_buff0_used~0_In749460834 256)) (and .cse1 (= 0 (mod ~x$r_buff1_thd2~0_In749460834 256)))))))) InVars {P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In749460834|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In749460834, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In749460834, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In749460834, ~weak$$choice2~0=~weak$$choice2~0_In749460834, ~x$w_buff0_used~0=~x$w_buff0_used~0_In749460834} OutVars{P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out749460834|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In749460834, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In749460834, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out749460834|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In749460834, ~weak$$choice2~0=~weak$$choice2~0_In749460834, ~x$w_buff0_used~0=~x$w_buff0_used~0_In749460834} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-27 07:12:41,344 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L740-->L740-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In561754081 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In561754081 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd1~0_In561754081 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In561754081 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out561754081| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P0Thread1of1ForFork0_#t~ite6_Out561754081| ~x$w_buff1_used~0_In561754081) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In561754081, ~x$w_buff1_used~0=~x$w_buff1_used~0_In561754081, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In561754081, ~x$w_buff0_used~0=~x$w_buff0_used~0_In561754081} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out561754081|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In561754081, ~x$w_buff1_used~0=~x$w_buff1_used~0_In561754081, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In561754081, ~x$w_buff0_used~0=~x$w_buff0_used~0_In561754081} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 07:12:41,345 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In248448539 256))) (.cse1 (= (mod ~x$r_buff0_thd1~0_In248448539 256) 0))) (or (and (= ~x$r_buff0_thd1~0_Out248448539 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~x$r_buff0_thd1~0_Out248448539 ~x$r_buff0_thd1~0_In248448539)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In248448539, ~x$w_buff0_used~0=~x$w_buff0_used~0_In248448539} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out248448539, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out248448539|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In248448539} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-27 07:12:41,346 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L742-->L742-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd1~0_In-2121954584 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-2121954584 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-2121954584 256))) (.cse2 (= (mod ~x$r_buff0_thd1~0_In-2121954584 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out-2121954584| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite8_Out-2121954584| ~x$r_buff1_thd1~0_In-2121954584) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-2121954584, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2121954584, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-2121954584, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2121954584} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-2121954584, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-2121954584|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2121954584, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-2121954584, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2121954584} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 07:12:41,346 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] L742-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_15 |v_P0Thread1of1ForFork0_#t~ite8_8|) (= v_~__unbuffered_cnt~0_7 (+ v_~__unbuffered_cnt~0_8 1)) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_7, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_15} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-27 07:12:41,346 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L767-->L768: Formula: (and (not (= (mod v_~weak$$choice2~0_19 256) 0)) (= v_~x$r_buff0_thd2~0_60 v_~x$r_buff0_thd2~0_59)) InVars {~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_19} OutVars{P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_9|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_59, ~weak$$choice2~0=v_~weak$$choice2~0_19, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_8|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_9|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite27, ~x$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-27 07:12:41,347 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L768-->L768-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In876712897 256)))) (or (and (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In876712897 256) 0))) (or (and .cse0 (= 0 (mod ~x$w_buff1_used~0_In876712897 256))) (and .cse0 (= 0 (mod ~x$r_buff1_thd2~0_In876712897 256))) (= 0 (mod ~x$w_buff0_used~0_In876712897 256)))) (= ~x$r_buff1_thd2~0_In876712897 |P1Thread1of1ForFork1_#t~ite29_Out876712897|) .cse1 (= |P1Thread1of1ForFork1_#t~ite30_Out876712897| |P1Thread1of1ForFork1_#t~ite29_Out876712897|)) (and (= |P1Thread1of1ForFork1_#t~ite30_Out876712897| ~x$r_buff1_thd2~0_In876712897) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite29_In876712897| |P1Thread1of1ForFork1_#t~ite29_Out876712897|)))) InVars {P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In876712897|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In876712897, ~x$w_buff1_used~0=~x$w_buff1_used~0_In876712897, ~weak$$choice2~0=~weak$$choice2~0_In876712897, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In876712897, ~x$w_buff0_used~0=~x$w_buff0_used~0_In876712897} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out876712897|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out876712897|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In876712897, ~x$w_buff1_used~0=~x$w_buff1_used~0_In876712897, ~weak$$choice2~0=~weak$$choice2~0_In876712897, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In876712897, ~x$w_buff0_used~0=~x$w_buff0_used~0_In876712897} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-27 07:12:41,348 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L770-->L774: Formula: (and (= 0 v_~x$flush_delayed~0_7) (not (= 0 (mod v_~x$flush_delayed~0_8 256))) (= v_~x$mem_tmp~0_5 v_~x~0_14)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_8, ~x$mem_tmp~0=v_~x$mem_tmp~0_5} OutVars{~x$flush_delayed~0=v_~x$flush_delayed~0_7, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~x$mem_tmp~0=v_~x$mem_tmp~0_5, ~x~0=v_~x~0_14} AuxVars[] AssignedVars[~x$flush_delayed~0, P1Thread1of1ForFork1_#t~ite31, ~x~0] because there is no mapped edge [2019-12-27 07:12:41,349 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L774-2-->L774-4: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In-1085999636 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1085999636 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite32_Out-1085999636| ~x~0_In-1085999636)) (and (not .cse1) (not .cse0) (= ~x$w_buff1~0_In-1085999636 |P1Thread1of1ForFork1_#t~ite32_Out-1085999636|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1085999636, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1085999636, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1085999636, ~x~0=~x~0_In-1085999636} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-1085999636, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1085999636, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1085999636, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-1085999636|, ~x~0=~x~0_In-1085999636} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 07:12:41,349 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L774-4-->L775: Formula: (= v_~x~0_16 |v_P1Thread1of1ForFork1_#t~ite32_8|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_8|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_7|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_7|, ~x~0=v_~x~0_16} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-27 07:12:41,350 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L775-->L775-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In-65909122 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-65909122 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite34_Out-65909122|)) (and (= ~x$w_buff0_used~0_In-65909122 |P1Thread1of1ForFork1_#t~ite34_Out-65909122|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-65909122, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-65909122} OutVars{P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-65909122|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-65909122, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-65909122} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 07:12:41,350 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L776-->L776-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In-2046287273 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-2046287273 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In-2046287273 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In-2046287273 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In-2046287273 |P1Thread1of1ForFork1_#t~ite35_Out-2046287273|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork1_#t~ite35_Out-2046287273|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-2046287273, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-2046287273, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2046287273, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2046287273} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-2046287273, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-2046287273, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-2046287273|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2046287273, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2046287273} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 07:12:41,351 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L777-->L777-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In26835046 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In26835046 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite36_Out26835046|) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite36_Out26835046| ~x$r_buff0_thd2~0_In26835046)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In26835046, ~x$w_buff0_used~0=~x$w_buff0_used~0_In26835046} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In26835046, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out26835046|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In26835046} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 07:12:41,352 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L778-->L778-2: Formula: (let ((.cse3 (= (mod ~x$r_buff1_thd2~0_In1672643886 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In1672643886 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In1672643886 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In1672643886 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite37_Out1672643886| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite37_Out1672643886| ~x$r_buff1_thd2~0_In1672643886)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1672643886, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1672643886, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1672643886, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1672643886} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1672643886, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1672643886, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1672643886, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out1672643886|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1672643886} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 07:12:41,352 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L778-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd2~0_44 |v_P1Thread1of1ForFork1_#t~ite37_8|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_44, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 07:12:41,353 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L803-->L805-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= (mod v_~x$w_buff0_used~0_83 256) 0) (= 0 (mod v_~x$r_buff0_thd0~0_17 256)))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_17, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_83} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_17, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_83} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 07:12:41,353 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L805-2-->L805-4: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd0~0_In782869223 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In782869223 256)))) (or (and (= ~x$w_buff1~0_In782869223 |ULTIMATE.start_main_#t~ite40_Out782869223|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~x~0_In782869223 |ULTIMATE.start_main_#t~ite40_Out782869223|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In782869223, ~x$w_buff1_used~0=~x$w_buff1_used~0_In782869223, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In782869223, ~x~0=~x~0_In782869223} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out782869223|, ~x$w_buff1~0=~x$w_buff1~0_In782869223, ~x$w_buff1_used~0=~x$w_buff1_used~0_In782869223, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In782869223, ~x~0=~x~0_In782869223} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 07:12:41,354 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L805-4-->L806: Formula: (= v_~x~0_17 |v_ULTIMATE.start_main_#t~ite40_7|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_7|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_6|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~x~0] because there is no mapped edge [2019-12-27 07:12:41,354 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L806-->L806-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In312737693 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In312737693 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite42_Out312737693|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In312737693 |ULTIMATE.start_main_#t~ite42_Out312737693|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In312737693, ~x$w_buff0_used~0=~x$w_buff0_used~0_In312737693} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In312737693, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out312737693|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In312737693} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 07:12:41,355 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L807-->L807-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In-1017875709 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In-1017875709 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd0~0_In-1017875709 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-1017875709 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite43_Out-1017875709|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$w_buff1_used~0_In-1017875709 |ULTIMATE.start_main_#t~ite43_Out-1017875709|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1017875709, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1017875709, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1017875709, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1017875709} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1017875709, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1017875709, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1017875709|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1017875709, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1017875709} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 07:12:41,356 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L808-->L808-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In458136706 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In458136706 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out458136706| ~x$r_buff0_thd0~0_In458136706) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite44_Out458136706| 0) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In458136706, ~x$w_buff0_used~0=~x$w_buff0_used~0_In458136706} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In458136706, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out458136706|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In458136706} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 07:12:41,356 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L809-->L809-2: Formula: (let ((.cse3 (= (mod ~x$w_buff0_used~0_In-1685163369 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd0~0_In-1685163369 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-1685163369 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-1685163369 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out-1685163369| ~x$r_buff1_thd0~0_In-1685163369) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |ULTIMATE.start_main_#t~ite45_Out-1685163369| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1685163369, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1685163369, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1685163369, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1685163369} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1685163369, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1685163369, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1685163369, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1685163369|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1685163369} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 07:12:41,357 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L809-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 2 v_~__unbuffered_p1_EAX~0_9) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 0) (= v_~x$r_buff1_thd0~0_15 |v_ULTIMATE.start_main_#t~ite45_14|) (= v_~main$tmp_guard1~0_12 0) (= v_~__unbuffered_p1_EBX~0_10 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_~y~0_13 2)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_10, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ~y~0=v_~y~0_13, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_14|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_10, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ~y~0=v_~y~0_13, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_15, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_13|, 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, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 07:12:41,439 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 07:12:41 BasicIcfg [2019-12-27 07:12:41,439 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 07:12:41,444 INFO L168 Benchmark]: Toolchain (without parser) took 15249.52 ms. Allocated memory was 136.8 MB in the beginning and 656.4 MB in the end (delta: 519.6 MB). Free memory was 100.2 MB in the beginning and 366.4 MB in the end (delta: -266.3 MB). Peak memory consumption was 253.3 MB. Max. memory is 7.1 GB. [2019-12-27 07:12:41,445 INFO L168 Benchmark]: CDTParser took 0.48 ms. Allocated memory is still 136.8 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 07:12:41,448 INFO L168 Benchmark]: CACSL2BoogieTranslator took 800.35 ms. Allocated memory was 136.8 MB in the beginning and 201.3 MB in the end (delta: 64.5 MB). Free memory was 99.7 MB in the beginning and 156.4 MB in the end (delta: -56.7 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. [2019-12-27 07:12:41,449 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.06 ms. Allocated memory is still 201.3 MB. Free memory was 156.4 MB in the beginning and 153.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 07:12:41,450 INFO L168 Benchmark]: Boogie Preprocessor took 37.18 ms. Allocated memory is still 201.3 MB. Free memory was 153.7 MB in the beginning and 151.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 07:12:41,450 INFO L168 Benchmark]: RCFGBuilder took 902.01 ms. Allocated memory is still 201.3 MB. Free memory was 151.0 MB in the beginning and 106.8 MB in the end (delta: 44.2 MB). Peak memory consumption was 44.2 MB. Max. memory is 7.1 GB. [2019-12-27 07:12:41,455 INFO L168 Benchmark]: TraceAbstraction took 13428.00 ms. Allocated memory was 201.3 MB in the beginning and 656.4 MB in the end (delta: 455.1 MB). Free memory was 106.8 MB in the beginning and 366.4 MB in the end (delta: -259.7 MB). Peak memory consumption was 195.4 MB. Max. memory is 7.1 GB. [2019-12-27 07:12:41,462 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.48 ms. Allocated memory is still 136.8 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 800.35 ms. Allocated memory was 136.8 MB in the beginning and 201.3 MB in the end (delta: 64.5 MB). Free memory was 99.7 MB in the beginning and 156.4 MB in the end (delta: -56.7 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 76.06 ms. Allocated memory is still 201.3 MB. Free memory was 156.4 MB in the beginning and 153.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.18 ms. Allocated memory is still 201.3 MB. Free memory was 153.7 MB in the beginning and 151.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 902.01 ms. Allocated memory is still 201.3 MB. Free memory was 151.0 MB in the beginning and 106.8 MB in the end (delta: 44.2 MB). Peak memory consumption was 44.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13428.00 ms. Allocated memory was 201.3 MB in the beginning and 656.4 MB in the end (delta: 455.1 MB). Free memory was 106.8 MB in the beginning and 366.4 MB in the end (delta: -259.7 MB). Peak memory consumption was 195.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.4s, 147 ProgramPointsBefore, 80 ProgramPointsAfterwards, 181 TransitionsBefore, 90 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 27 ChoiceCompositions, 4527 VarBasedMoverChecksPositive, 162 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 50908 CheckedPairsTotal, 100 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L797] FCALL, FORK 0 pthread_create(&t1713, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L724] 1 x$w_buff1 = x$w_buff0 [L725] 1 x$w_buff0 = 1 [L726] 1 x$w_buff1_used = x$w_buff0_used [L727] 1 x$w_buff0_used = (_Bool)1 [L738] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L799] FCALL, FORK 0 pthread_create(&t1714, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L752] 2 y = 2 [L755] 2 __unbuffered_p1_EAX = y [L758] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L759] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L760] 2 x$flush_delayed = weak$$choice2 [L761] 2 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L762] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L738] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L762] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L763] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L764] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L765] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L766] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L766] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L739] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L740] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L768] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L769] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L774] 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L776] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L777] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L801] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L806] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L807] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L808] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 13.1s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1632 SDtfs, 1717 SDslu, 2579 SDs, 0 SdLazy, 1439 SolverSat, 104 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 73 GetRequests, 16 SyntacticMatches, 7 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12676occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.5s AutomataMinimizationTime, 13 MinimizatonAttempts, 7789 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 383 NumberOfCodeBlocks, 383 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 317 ConstructedInterpolants, 0 QuantifiedInterpolants, 31643 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...