/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/mix038_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 06:22:58,949 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 06:22:58,951 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 06:22:58,963 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 06:22:58,964 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 06:22:58,965 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 06:22:58,966 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 06:22:58,968 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 06:22:58,970 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 06:22:58,971 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 06:22:58,972 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 06:22:58,973 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 06:22:58,973 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 06:22:58,974 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 06:22:58,975 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 06:22:58,976 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 06:22:58,977 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 06:22:58,978 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 06:22:58,980 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 06:22:58,982 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 06:22:58,983 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 06:22:58,984 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 06:22:58,985 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 06:22:58,986 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 06:22:58,989 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 06:22:58,989 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 06:22:58,989 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 06:22:58,990 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 06:22:58,991 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 06:22:58,991 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 06:22:58,992 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 06:22:58,993 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 06:22:58,993 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 06:22:58,994 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 06:22:58,995 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 06:22:58,995 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 06:22:58,996 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 06:22:58,996 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 06:22:58,996 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 06:22:58,997 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 06:22:58,998 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 06:22:58,999 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 06:22:59,015 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 06:22:59,015 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 06:22:59,017 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 06:22:59,017 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 06:22:59,017 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 06:22:59,017 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 06:22:59,017 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 06:22:59,018 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 06:22:59,018 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 06:22:59,018 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 06:22:59,018 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 06:22:59,018 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 06:22:59,019 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 06:22:59,019 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 06:22:59,020 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 06:22:59,020 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 06:22:59,020 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 06:22:59,020 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 06:22:59,021 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 06:22:59,021 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 06:22:59,021 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 06:22:59,022 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 06:22:59,022 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 06:22:59,022 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 06:22:59,022 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 06:22:59,023 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 06:22:59,023 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 06:22:59,023 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 06:22:59,023 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 06:22:59,023 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 06:22:59,318 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 06:22:59,335 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 06:22:59,338 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 06:22:59,339 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 06:22:59,340 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 06:22:59,340 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix038_pso.opt.i [2019-12-27 06:22:59,402 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1180ed36e/f6d15c9fbfdb42e1940df6b272a565a5/FLAG3d7189131 [2019-12-27 06:22:59,933 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 06:22:59,934 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix038_pso.opt.i [2019-12-27 06:22:59,949 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1180ed36e/f6d15c9fbfdb42e1940df6b272a565a5/FLAG3d7189131 [2019-12-27 06:23:00,252 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1180ed36e/f6d15c9fbfdb42e1940df6b272a565a5 [2019-12-27 06:23:00,261 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 06:23:00,263 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 06:23:00,264 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 06:23:00,264 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 06:23:00,268 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 06:23:00,269 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:23:00" (1/1) ... [2019-12-27 06:23:00,274 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e400b9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:23:00, skipping insertion in model container [2019-12-27 06:23:00,274 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:23:00" (1/1) ... [2019-12-27 06:23:00,283 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 06:23:00,351 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 06:23:00,895 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:23:00,907 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 06:23:00,965 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:23:01,045 INFO L208 MainTranslator]: Completed translation [2019-12-27 06:23:01,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:23:01 WrapperNode [2019-12-27 06:23:01,046 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 06:23:01,047 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 06:23:01,047 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 06:23:01,047 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 06:23:01,056 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:23:01" (1/1) ... [2019-12-27 06:23:01,075 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:23:01" (1/1) ... [2019-12-27 06:23:01,116 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 06:23:01,117 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 06:23:01,120 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 06:23:01,120 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 06:23:01,130 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:23:01" (1/1) ... [2019-12-27 06:23:01,130 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:23:01" (1/1) ... [2019-12-27 06:23:01,135 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:23:01" (1/1) ... [2019-12-27 06:23:01,135 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:23:01" (1/1) ... [2019-12-27 06:23:01,145 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:23:01" (1/1) ... [2019-12-27 06:23:01,149 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:23:01" (1/1) ... [2019-12-27 06:23:01,152 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:23:01" (1/1) ... [2019-12-27 06:23:01,157 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 06:23:01,158 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 06:23:01,158 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 06:23:01,158 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 06:23:01,161 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:23:01" (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 06:23:01,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 06:23:01,225 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 06:23:01,225 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 06:23:01,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 06:23:01,225 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 06:23:01,225 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 06:23:01,226 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 06:23:01,226 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 06:23:01,226 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 06:23:01,226 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 06:23:01,226 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 06:23:01,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 06:23:01,227 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 06:23:01,228 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 06:23:01,939 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 06:23:01,939 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 06:23:01,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:23:01 BoogieIcfgContainer [2019-12-27 06:23:01,941 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 06:23:01,942 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 06:23:01,942 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 06:23:01,945 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 06:23:01,946 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:23:00" (1/3) ... [2019-12-27 06:23:01,947 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5354010c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:23:01, skipping insertion in model container [2019-12-27 06:23:01,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:23:01" (2/3) ... [2019-12-27 06:23:01,947 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5354010c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:23:01, skipping insertion in model container [2019-12-27 06:23:01,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:23:01" (3/3) ... [2019-12-27 06:23:01,949 INFO L109 eAbstractionObserver]: Analyzing ICFG mix038_pso.opt.i [2019-12-27 06:23:01,961 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 06:23:01,961 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 06:23:01,970 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 06:23:01,973 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 06:23:02,027 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,027 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,028 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,028 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,028 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,029 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,031 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,032 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,045 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,045 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,045 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,051 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,051 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,062 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,062 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,062 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,062 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,063 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,063 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,063 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,063 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,065 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,065 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,065 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,065 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,066 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,066 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,066 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,066 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,073 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,074 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,074 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,079 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,082 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,086 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,086 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,087 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:02,105 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 06:23:02,141 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 06:23:02,141 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 06:23:02,142 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 06:23:02,142 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 06:23:02,142 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 06:23:02,142 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 06:23:02,142 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 06:23:02,142 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 06:23:02,159 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 153 places, 178 transitions [2019-12-27 06:23:02,161 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 153 places, 178 transitions [2019-12-27 06:23:02,262 INFO L132 PetriNetUnfolder]: 35/175 cut-off events. [2019-12-27 06:23:02,263 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:23:02,280 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 175 events. 35/175 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 344 event pairs. 0/138 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-12-27 06:23:02,297 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 153 places, 178 transitions [2019-12-27 06:23:02,363 INFO L132 PetriNetUnfolder]: 35/175 cut-off events. [2019-12-27 06:23:02,363 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:23:02,369 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 175 events. 35/175 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 344 event pairs. 0/138 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-12-27 06:23:02,383 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11400 [2019-12-27 06:23:02,384 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 06:23:05,738 WARN L192 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-27 06:23:05,874 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-27 06:23:05,915 INFO L206 etLargeBlockEncoding]: Checked pairs total: 42021 [2019-12-27 06:23:05,915 INFO L214 etLargeBlockEncoding]: Total number of compositions: 111 [2019-12-27 06:23:05,918 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 73 places, 80 transitions [2019-12-27 06:23:06,675 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 13626 states. [2019-12-27 06:23:06,677 INFO L276 IsEmpty]: Start isEmpty. Operand 13626 states. [2019-12-27 06:23:06,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 06:23:06,683 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:23:06,683 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:23:06,684 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:23:06,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:23:06,689 INFO L82 PathProgramCache]: Analyzing trace with hash 615279903, now seen corresponding path program 1 times [2019-12-27 06:23:06,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:23:06,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948223401] [2019-12-27 06:23:06,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:23:06,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:23:06,993 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 06:23:06,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948223401] [2019-12-27 06:23:06,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:23:06,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 06:23:06,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757525660] [2019-12-27 06:23:06,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:23:06,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:23:07,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:23:07,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:23:07,014 INFO L87 Difference]: Start difference. First operand 13626 states. Second operand 3 states. [2019-12-27 06:23:07,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:23:07,393 INFO L93 Difference]: Finished difference Result 13322 states and 50870 transitions. [2019-12-27 06:23:07,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:23:07,395 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-27 06:23:07,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:23:07,731 INFO L225 Difference]: With dead ends: 13322 [2019-12-27 06:23:07,733 INFO L226 Difference]: Without dead ends: 12542 [2019-12-27 06:23:07,736 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 06:23:07,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12542 states. [2019-12-27 06:23:08,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12542 to 12542. [2019-12-27 06:23:08,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12542 states. [2019-12-27 06:23:08,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12542 states to 12542 states and 47820 transitions. [2019-12-27 06:23:08,399 INFO L78 Accepts]: Start accepts. Automaton has 12542 states and 47820 transitions. Word has length 7 [2019-12-27 06:23:08,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:23:08,400 INFO L462 AbstractCegarLoop]: Abstraction has 12542 states and 47820 transitions. [2019-12-27 06:23:08,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:23:08,401 INFO L276 IsEmpty]: Start isEmpty. Operand 12542 states and 47820 transitions. [2019-12-27 06:23:08,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 06:23:08,411 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:23:08,412 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:23:08,412 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:23:08,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:23:08,413 INFO L82 PathProgramCache]: Analyzing trace with hash -391053263, now seen corresponding path program 1 times [2019-12-27 06:23:08,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:23:08,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540273799] [2019-12-27 06:23:08,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:23:08,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:23:08,561 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 06:23:08,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540273799] [2019-12-27 06:23:08,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:23:08,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:23:08,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414375022] [2019-12-27 06:23:08,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:23:08,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:23:08,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:23:08,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:23:08,567 INFO L87 Difference]: Start difference. First operand 12542 states and 47820 transitions. Second operand 3 states. [2019-12-27 06:23:09,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:23:09,386 INFO L93 Difference]: Finished difference Result 7513 states and 25047 transitions. [2019-12-27 06:23:09,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:23:09,386 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 06:23:09,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:23:09,425 INFO L225 Difference]: With dead ends: 7513 [2019-12-27 06:23:09,425 INFO L226 Difference]: Without dead ends: 7513 [2019-12-27 06:23:09,426 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 06:23:09,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7513 states. [2019-12-27 06:23:09,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7513 to 7513. [2019-12-27 06:23:09,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7513 states. [2019-12-27 06:23:09,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7513 states to 7513 states and 25047 transitions. [2019-12-27 06:23:09,687 INFO L78 Accepts]: Start accepts. Automaton has 7513 states and 25047 transitions. Word has length 13 [2019-12-27 06:23:09,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:23:09,687 INFO L462 AbstractCegarLoop]: Abstraction has 7513 states and 25047 transitions. [2019-12-27 06:23:09,687 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:23:09,687 INFO L276 IsEmpty]: Start isEmpty. Operand 7513 states and 25047 transitions. [2019-12-27 06:23:09,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 06:23:09,689 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:23:09,689 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:23:09,689 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:23:09,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:23:09,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1810905474, now seen corresponding path program 1 times [2019-12-27 06:23:09,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:23:09,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139098733] [2019-12-27 06:23:09,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:23:09,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:23:09,769 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 06:23:09,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139098733] [2019-12-27 06:23:09,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:23:09,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:23:09,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975257282] [2019-12-27 06:23:09,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:23:09,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:23:09,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:23:09,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:23:09,771 INFO L87 Difference]: Start difference. First operand 7513 states and 25047 transitions. Second operand 4 states. [2019-12-27 06:23:09,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:23:09,828 INFO L93 Difference]: Finished difference Result 1752 states and 4700 transitions. [2019-12-27 06:23:09,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:23:09,829 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 06:23:09,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:23:09,834 INFO L225 Difference]: With dead ends: 1752 [2019-12-27 06:23:09,834 INFO L226 Difference]: Without dead ends: 1752 [2019-12-27 06:23:09,835 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:23:09,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1752 states. [2019-12-27 06:23:09,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1752 to 1752. [2019-12-27 06:23:09,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1752 states. [2019-12-27 06:23:09,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1752 states to 1752 states and 4700 transitions. [2019-12-27 06:23:09,884 INFO L78 Accepts]: Start accepts. Automaton has 1752 states and 4700 transitions. Word has length 14 [2019-12-27 06:23:09,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:23:09,884 INFO L462 AbstractCegarLoop]: Abstraction has 1752 states and 4700 transitions. [2019-12-27 06:23:09,885 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:23:09,885 INFO L276 IsEmpty]: Start isEmpty. Operand 1752 states and 4700 transitions. [2019-12-27 06:23:09,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 06:23:09,886 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:23:09,886 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:23:09,886 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:23:09,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:23:09,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1355676511, now seen corresponding path program 1 times [2019-12-27 06:23:09,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:23:09,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440840294] [2019-12-27 06:23:09,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:23:09,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:23:09,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:23:09,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440840294] [2019-12-27 06:23:09,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:23:09,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:23:09,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603293145] [2019-12-27 06:23:09,949 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:23:09,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:23:09,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:23:09,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:23:09,949 INFO L87 Difference]: Start difference. First operand 1752 states and 4700 transitions. Second operand 4 states. [2019-12-27 06:23:10,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:23:10,146 INFO L93 Difference]: Finished difference Result 2319 states and 6117 transitions. [2019-12-27 06:23:10,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:23:10,147 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 06:23:10,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:23:10,153 INFO L225 Difference]: With dead ends: 2319 [2019-12-27 06:23:10,153 INFO L226 Difference]: Without dead ends: 2319 [2019-12-27 06:23:10,154 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 06:23:10,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2319 states. [2019-12-27 06:23:10,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2319 to 2159. [2019-12-27 06:23:10,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2159 states. [2019-12-27 06:23:10,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2159 states to 2159 states and 5759 transitions. [2019-12-27 06:23:10,272 INFO L78 Accepts]: Start accepts. Automaton has 2159 states and 5759 transitions. Word has length 16 [2019-12-27 06:23:10,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:23:10,272 INFO L462 AbstractCegarLoop]: Abstraction has 2159 states and 5759 transitions. [2019-12-27 06:23:10,272 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:23:10,273 INFO L276 IsEmpty]: Start isEmpty. Operand 2159 states and 5759 transitions. [2019-12-27 06:23:10,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 06:23:10,276 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:23:10,277 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] [2019-12-27 06:23:10,277 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:23:10,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:23:10,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1253128974, now seen corresponding path program 1 times [2019-12-27 06:23:10,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:23:10,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929261805] [2019-12-27 06:23:10,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:23:10,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:23:10,355 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 06:23:10,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929261805] [2019-12-27 06:23:10,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:23:10,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:23:10,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469401009] [2019-12-27 06:23:10,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:23:10,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:23:10,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:23:10,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:23:10,358 INFO L87 Difference]: Start difference. First operand 2159 states and 5759 transitions. Second operand 5 states. [2019-12-27 06:23:10,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:23:10,391 INFO L93 Difference]: Finished difference Result 1278 states and 3496 transitions. [2019-12-27 06:23:10,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:23:10,392 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-27 06:23:10,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:23:10,395 INFO L225 Difference]: With dead ends: 1278 [2019-12-27 06:23:10,395 INFO L226 Difference]: Without dead ends: 1278 [2019-12-27 06:23:10,396 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:23:10,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1278 states. [2019-12-27 06:23:10,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1278 to 1218. [2019-12-27 06:23:10,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1218 states. [2019-12-27 06:23:10,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 3346 transitions. [2019-12-27 06:23:10,425 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 3346 transitions. Word has length 29 [2019-12-27 06:23:10,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:23:10,426 INFO L462 AbstractCegarLoop]: Abstraction has 1218 states and 3346 transitions. [2019-12-27 06:23:10,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:23:10,426 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 3346 transitions. [2019-12-27 06:23:10,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 06:23:10,430 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:23:10,430 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] [2019-12-27 06:23:10,430 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:23:10,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:23:10,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1013252767, now seen corresponding path program 1 times [2019-12-27 06:23:10,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:23:10,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977620322] [2019-12-27 06:23:10,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:23:10,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:23:10,517 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 06:23:10,518 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977620322] [2019-12-27 06:23:10,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:23:10,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:23:10,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314492641] [2019-12-27 06:23:10,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:23:10,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:23:10,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:23:10,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:23:10,520 INFO L87 Difference]: Start difference. First operand 1218 states and 3346 transitions. Second operand 6 states. [2019-12-27 06:23:10,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:23:10,726 INFO L93 Difference]: Finished difference Result 3114 states and 8422 transitions. [2019-12-27 06:23:10,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 06:23:10,726 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2019-12-27 06:23:10,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:23:10,732 INFO L225 Difference]: With dead ends: 3114 [2019-12-27 06:23:10,732 INFO L226 Difference]: Without dead ends: 2096 [2019-12-27 06:23:10,733 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:23:10,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2096 states. [2019-12-27 06:23:10,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2096 to 1332. [2019-12-27 06:23:10,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1332 states. [2019-12-27 06:23:10,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1332 states to 1332 states and 3659 transitions. [2019-12-27 06:23:10,774 INFO L78 Accepts]: Start accepts. Automaton has 1332 states and 3659 transitions. Word has length 44 [2019-12-27 06:23:10,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:23:10,774 INFO L462 AbstractCegarLoop]: Abstraction has 1332 states and 3659 transitions. [2019-12-27 06:23:10,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:23:10,774 INFO L276 IsEmpty]: Start isEmpty. Operand 1332 states and 3659 transitions. [2019-12-27 06:23:10,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 06:23:10,778 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:23:10,778 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] [2019-12-27 06:23:10,779 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:23:10,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:23:10,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1227474999, now seen corresponding path program 2 times [2019-12-27 06:23:10,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:23:10,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030823857] [2019-12-27 06:23:10,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:23:10,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:23:10,873 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 06:23:10,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030823857] [2019-12-27 06:23:10,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:23:10,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:23:10,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146110928] [2019-12-27 06:23:10,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:23:10,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:23:10,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:23:10,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:23:10,875 INFO L87 Difference]: Start difference. First operand 1332 states and 3659 transitions. Second operand 3 states. [2019-12-27 06:23:10,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:23:10,891 INFO L93 Difference]: Finished difference Result 1991 states and 5148 transitions. [2019-12-27 06:23:10,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:23:10,891 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-12-27 06:23:10,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:23:10,900 INFO L225 Difference]: With dead ends: 1991 [2019-12-27 06:23:10,901 INFO L226 Difference]: Without dead ends: 699 [2019-12-27 06:23:10,901 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 06:23:10,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2019-12-27 06:23:10,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 699. [2019-12-27 06:23:10,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 699 states. [2019-12-27 06:23:10,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 1564 transitions. [2019-12-27 06:23:10,917 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 1564 transitions. Word has length 44 [2019-12-27 06:23:10,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:23:10,917 INFO L462 AbstractCegarLoop]: Abstraction has 699 states and 1564 transitions. [2019-12-27 06:23:10,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:23:10,917 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 1564 transitions. [2019-12-27 06:23:10,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 06:23:10,919 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:23:10,919 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] [2019-12-27 06:23:10,919 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:23:10,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:23:10,920 INFO L82 PathProgramCache]: Analyzing trace with hash 182422381, now seen corresponding path program 3 times [2019-12-27 06:23:10,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:23:10,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197873619] [2019-12-27 06:23:10,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:23:10,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:23:11,159 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 06:23:11,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197873619] [2019-12-27 06:23:11,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:23:11,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 06:23:11,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40652215] [2019-12-27 06:23:11,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 06:23:11,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:23:11,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 06:23:11,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:23:11,161 INFO L87 Difference]: Start difference. First operand 699 states and 1564 transitions. Second operand 9 states. [2019-12-27 06:23:12,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:23:12,404 INFO L93 Difference]: Finished difference Result 1586 states and 3398 transitions. [2019-12-27 06:23:12,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 06:23:12,405 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 44 [2019-12-27 06:23:12,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:23:12,418 INFO L225 Difference]: With dead ends: 1586 [2019-12-27 06:23:12,418 INFO L226 Difference]: Without dead ends: 1586 [2019-12-27 06:23:12,419 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2019-12-27 06:23:12,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2019-12-27 06:23:12,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 889. [2019-12-27 06:23:12,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 889 states. [2019-12-27 06:23:12,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1963 transitions. [2019-12-27 06:23:12,447 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 1963 transitions. Word has length 44 [2019-12-27 06:23:12,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:23:12,447 INFO L462 AbstractCegarLoop]: Abstraction has 889 states and 1963 transitions. [2019-12-27 06:23:12,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 06:23:12,448 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1963 transitions. [2019-12-27 06:23:12,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 06:23:12,450 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:23:12,450 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] [2019-12-27 06:23:12,450 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:23:12,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:23:12,451 INFO L82 PathProgramCache]: Analyzing trace with hash 106963507, now seen corresponding path program 4 times [2019-12-27 06:23:12,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:23:12,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784443722] [2019-12-27 06:23:12,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:23:12,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:23:12,569 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 06:23:12,569 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784443722] [2019-12-27 06:23:12,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:23:12,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 06:23:12,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461001517] [2019-12-27 06:23:12,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 06:23:12,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:23:12,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 06:23:12,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:23:12,571 INFO L87 Difference]: Start difference. First operand 889 states and 1963 transitions. Second operand 9 states. [2019-12-27 06:23:13,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:23:13,744 INFO L93 Difference]: Finished difference Result 4489 states and 9977 transitions. [2019-12-27 06:23:13,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-27 06:23:13,745 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 44 [2019-12-27 06:23:13,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:23:13,751 INFO L225 Difference]: With dead ends: 4489 [2019-12-27 06:23:13,752 INFO L226 Difference]: Without dead ends: 3413 [2019-12-27 06:23:13,753 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 348 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=347, Invalid=985, Unknown=0, NotChecked=0, Total=1332 [2019-12-27 06:23:13,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3413 states. [2019-12-27 06:23:13,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3413 to 1255. [2019-12-27 06:23:13,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1255 states. [2019-12-27 06:23:13,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 2870 transitions. [2019-12-27 06:23:13,801 INFO L78 Accepts]: Start accepts. Automaton has 1255 states and 2870 transitions. Word has length 44 [2019-12-27 06:23:13,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:23:13,802 INFO L462 AbstractCegarLoop]: Abstraction has 1255 states and 2870 transitions. [2019-12-27 06:23:13,802 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 06:23:13,802 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 2870 transitions. [2019-12-27 06:23:13,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 06:23:13,805 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:23:13,805 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] [2019-12-27 06:23:13,805 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:23:13,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:23:13,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1897110467, now seen corresponding path program 5 times [2019-12-27 06:23:13,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:23:13,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287982080] [2019-12-27 06:23:13,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:23:13,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:23:13,924 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 06:23:13,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287982080] [2019-12-27 06:23:13,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:23:13,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 06:23:13,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045927803] [2019-12-27 06:23:13,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:23:13,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:23:13,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:23:13,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:23:13,926 INFO L87 Difference]: Start difference. First operand 1255 states and 2870 transitions. Second operand 7 states. [2019-12-27 06:23:14,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:23:14,813 INFO L93 Difference]: Finished difference Result 2524 states and 5552 transitions. [2019-12-27 06:23:14,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 06:23:14,814 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 44 [2019-12-27 06:23:14,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:23:14,818 INFO L225 Difference]: With dead ends: 2524 [2019-12-27 06:23:14,818 INFO L226 Difference]: Without dead ends: 2516 [2019-12-27 06:23:14,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2019-12-27 06:23:14,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2516 states. [2019-12-27 06:23:14,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2516 to 1296. [2019-12-27 06:23:14,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1296 states. [2019-12-27 06:23:14,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1296 states to 1296 states and 2986 transitions. [2019-12-27 06:23:14,851 INFO L78 Accepts]: Start accepts. Automaton has 1296 states and 2986 transitions. Word has length 44 [2019-12-27 06:23:14,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:23:14,851 INFO L462 AbstractCegarLoop]: Abstraction has 1296 states and 2986 transitions. [2019-12-27 06:23:14,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:23:14,852 INFO L276 IsEmpty]: Start isEmpty. Operand 1296 states and 2986 transitions. [2019-12-27 06:23:14,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 06:23:14,855 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:23:14,855 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] [2019-12-27 06:23:14,855 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:23:14,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:23:14,856 INFO L82 PathProgramCache]: Analyzing trace with hash -244228541, now seen corresponding path program 6 times [2019-12-27 06:23:14,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:23:14,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353678435] [2019-12-27 06:23:14,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:23:14,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:23:14,910 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 06:23:14,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353678435] [2019-12-27 06:23:14,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:23:14,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:23:14,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691766838] [2019-12-27 06:23:14,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:23:14,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:23:14,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:23:14,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:23:14,912 INFO L87 Difference]: Start difference. First operand 1296 states and 2986 transitions. Second operand 3 states. [2019-12-27 06:23:14,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:23:14,925 INFO L93 Difference]: Finished difference Result 1294 states and 2981 transitions. [2019-12-27 06:23:14,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:23:14,926 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-12-27 06:23:14,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:23:14,928 INFO L225 Difference]: With dead ends: 1294 [2019-12-27 06:23:14,928 INFO L226 Difference]: Without dead ends: 1294 [2019-12-27 06:23:14,928 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 06:23:14,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1294 states. [2019-12-27 06:23:14,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1294 to 1173. [2019-12-27 06:23:14,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1173 states. [2019-12-27 06:23:14,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1173 states to 1173 states and 2751 transitions. [2019-12-27 06:23:14,948 INFO L78 Accepts]: Start accepts. Automaton has 1173 states and 2751 transitions. Word has length 44 [2019-12-27 06:23:14,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:23:14,949 INFO L462 AbstractCegarLoop]: Abstraction has 1173 states and 2751 transitions. [2019-12-27 06:23:14,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:23:14,949 INFO L276 IsEmpty]: Start isEmpty. Operand 1173 states and 2751 transitions. [2019-12-27 06:23:14,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-27 06:23:14,952 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:23:14,952 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] [2019-12-27 06:23:14,952 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:23:14,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:23:14,953 INFO L82 PathProgramCache]: Analyzing trace with hash 730797803, now seen corresponding path program 1 times [2019-12-27 06:23:14,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:23:14,953 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566923166] [2019-12-27 06:23:14,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:23:14,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:23:15,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:23:15,047 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 06:23:15,047 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 06:23:15,051 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [729] [729] ULTIMATE.startENTRY-->L820: Formula: (let ((.cse0 (store |v_#valid_62| 0 0))) (and (= 0 v_~y$read_delayed_var~0.offset_7) (= 0 v_~__unbuffered_p1_EAX~0_15) (= v_~main$tmp_guard0~0_9 0) (= v_~a~0_11 0) (= |v_#NULL.offset_6| 0) (= v_~y$read_delayed~0_7 0) (= |v_#valid_60| (store .cse0 |v_ULTIMATE.start_main_~#t1010~0.base_25| 1)) (= 0 v_~y$mem_tmp~0_9) (= v_~z~0_10 0) (= v_~y$r_buff0_thd1~0_9 0) (= v_~__unbuffered_p2_EBX~0_16 0) (< 0 |v_#StackHeapBarrier_16|) (= 0 v_~y$r_buff1_thd1~0_10) (= v_~y$r_buff0_thd2~0_67 0) (= 0 v_~y$w_buff0~0_23) (= 0 v_~y$r_buff1_thd0~0_24) (= v_~y$w_buff1_used~0_57 0) (= v_~x~0_17 0) (= 0 v_~__unbuffered_p2_EAX~0_16) (= v_~y~0_20 0) (= v_~y$r_buff0_thd0~0_20 0) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice2~0_33) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t1010~0.base_25|) (= 0 v_~weak$$choice0~0_7) (= 0 |v_ULTIMATE.start_main_~#t1010~0.offset_19|) (= 0 v_~y$read_delayed_var~0.base_7) (= 0 v_~y$w_buff0_used~0_91) (= v_~main$tmp_guard1~0_15 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1010~0.base_25|) 0) (= 0 v_~__unbuffered_cnt~0_22) (= 0 v_~y$r_buff1_thd3~0_18) (= 0 v_~y$w_buff1~0_20) (= v_~y$r_buff0_thd3~0_27 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1010~0.base_25| 4)) (= 0 v_~y$r_buff1_thd2~0_43) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1010~0.base_25| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1010~0.base_25|) |v_ULTIMATE.start_main_~#t1010~0.offset_19| 0)) |v_#memory_int_19|) (= 0 v_~y$flush_delayed~0_11))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_9|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_8|, ULTIMATE.start_main_~#t1010~0.offset=|v_ULTIMATE.start_main_~#t1010~0.offset_19|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_~#t1011~0.base=|v_ULTIMATE.start_main_~#t1011~0.base_26|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~a~0=v_~a~0_11, ~y$mem_tmp~0=v_~y$mem_tmp~0_9, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_18, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_15, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_9, ~y$flush_delayed~0=v_~y$flush_delayed~0_11, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ULTIMATE.start_main_~#t1010~0.base=|v_ULTIMATE.start_main_~#t1010~0.base_25|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_10|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_12|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_10|, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_23|, ~y$w_buff1~0=v_~y$w_buff1~0_20, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_67, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_24, ~x~0=v_~x~0_17, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_91, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_9|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_10, ~y$w_buff0~0=v_~y$w_buff0~0_23, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_27, ULTIMATE.start_main_~#t1012~0.base=|v_ULTIMATE.start_main_~#t1012~0.base_21|, ~y~0=v_~y~0_20, ULTIMATE.start_main_~#t1012~0.offset=|v_ULTIMATE.start_main_~#t1012~0.offset_14|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_12|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_10|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_43, ULTIMATE.start_main_~#t1011~0.offset=|v_ULTIMATE.start_main_~#t1011~0.offset_19|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_20, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_10, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_57} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ULTIMATE.start_main_~#t1010~0.offset, #NULL.offset, ULTIMATE.start_main_~#t1011~0.base, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_~#t1010~0.base, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard1~0, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ULTIMATE.start_main_~#t1012~0.base, ~y~0, ULTIMATE.start_main_~#t1012~0.offset, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ULTIMATE.start_main_~#t1011~0.offset, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 06:23:15,052 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L820-1-->L822: Formula: (and (= |v_#valid_32| (store |v_#valid_33| |v_ULTIMATE.start_main_~#t1011~0.base_11| 1)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1011~0.base_11| 4)) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1011~0.base_11| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1011~0.base_11|) |v_ULTIMATE.start_main_~#t1011~0.offset_9| 1)) |v_#memory_int_9|) (= |v_ULTIMATE.start_main_~#t1011~0.offset_9| 0) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1011~0.base_11|) (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t1011~0.base_11|)) (not (= 0 |v_ULTIMATE.start_main_~#t1011~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_4|, ULTIMATE.start_main_~#t1011~0.offset=|v_ULTIMATE.start_main_~#t1011~0.offset_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1011~0.base=|v_ULTIMATE.start_main_~#t1011~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1011~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1011~0.base] because there is no mapped edge [2019-12-27 06:23:15,053 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L822-1-->L824: Formula: (and (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t1012~0.base_10| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t1012~0.base_10|)) (= (select |v_#valid_35| |v_ULTIMATE.start_main_~#t1012~0.base_10|) 0) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1012~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1012~0.base_10|) |v_ULTIMATE.start_main_~#t1012~0.offset_8| 2))) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1012~0.base_10|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1012~0.base_10| 4)) (= |v_ULTIMATE.start_main_~#t1012~0.offset_8| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t1012~0.offset=|v_ULTIMATE.start_main_~#t1012~0.offset_8|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_4|, ULTIMATE.start_main_~#t1012~0.base=|v_ULTIMATE.start_main_~#t1012~0.base_10|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1012~0.offset, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t1012~0.base, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 06:23:15,054 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L4-->L797: Formula: (and (= ~y$r_buff1_thd2~0_Out1449505153 ~y$r_buff0_thd2~0_In1449505153) (= ~a~0_In1449505153 ~__unbuffered_p2_EBX~0_Out1449505153) (= ~y$r_buff1_thd0~0_Out1449505153 ~y$r_buff0_thd0~0_In1449505153) (= ~y$r_buff1_thd1~0_Out1449505153 ~y$r_buff0_thd1~0_In1449505153) (= ~y$r_buff0_thd3~0_Out1449505153 1) (= ~z~0_Out1449505153 ~__unbuffered_p2_EAX~0_Out1449505153) (= ~z~0_Out1449505153 1) (= ~y$r_buff0_thd3~0_In1449505153 ~y$r_buff1_thd3~0_Out1449505153) (not (= P2Thread1of1ForFork2___VERIFIER_assert_~expression_In1449505153 0))) InVars {~a~0=~a~0_In1449505153, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1449505153, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1449505153, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1449505153, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1449505153, P2Thread1of1ForFork2___VERIFIER_assert_~expression=P2Thread1of1ForFork2___VERIFIER_assert_~expression_In1449505153} OutVars{~__unbuffered_p2_EBX~0=~__unbuffered_p2_EBX~0_Out1449505153, P2Thread1of1ForFork2___VERIFIER_assert_~expression=P2Thread1of1ForFork2___VERIFIER_assert_~expression_In1449505153, ~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out1449505153, ~a~0=~a~0_In1449505153, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out1449505153, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_Out1449505153, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out1449505153, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1449505153, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1449505153, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1449505153, ~__unbuffered_p2_EAX~0=~__unbuffered_p2_EAX~0_Out1449505153, ~z~0=~z~0_Out1449505153, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out1449505153} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p2_EBX~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 06:23:15,055 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork0_~arg.base_5 |v_P0Thread1of1ForFork0_#in~arg.base_5|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= 1 v_~a~0_6) (= v_P0Thread1of1ForFork0_~arg.offset_5 |v_P0Thread1of1ForFork0_#in~arg.offset_5|) (= 1 v_~x~0_8) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_18 (+ v_~__unbuffered_cnt~0_19 1))) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19} OutVars{~a~0=v_~a~0_6, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_5, ~x~0=v_~x~0_8, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_5} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-27 06:23:15,058 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L756-->L756-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In1302917514 256) 0))) (or (and (= ~y$w_buff0~0_In1302917514 |P1Thread1of1ForFork1_#t~ite8_Out1302917514|) (= |P1Thread1of1ForFork1_#t~ite8_Out1302917514| |P1Thread1of1ForFork1_#t~ite9_Out1302917514|) (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In1302917514 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In1302917514 256)) (and .cse0 (= (mod ~y$r_buff1_thd2~0_In1302917514 256) 0)) (and .cse0 (= (mod ~y$w_buff1_used~0_In1302917514 256) 0)))) .cse1) (and (= ~y$w_buff0~0_In1302917514 |P1Thread1of1ForFork1_#t~ite9_Out1302917514|) (= |P1Thread1of1ForFork1_#t~ite8_In1302917514| |P1Thread1of1ForFork1_#t~ite8_Out1302917514|) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1302917514, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1302917514, ~y$w_buff0~0=~y$w_buff0~0_In1302917514, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1302917514, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_In1302917514|, ~weak$$choice2~0=~weak$$choice2~0_In1302917514, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1302917514} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1302917514, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1302917514, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out1302917514|, ~y$w_buff0~0=~y$w_buff0~0_In1302917514, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1302917514, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_Out1302917514|, ~weak$$choice2~0=~weak$$choice2~0_In1302917514, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1302917514} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 06:23:15,060 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L757-->L757-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-1865451141 256)))) (or (and (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1865451141 256)))) (or (and (= (mod ~y$w_buff1_used~0_In-1865451141 256) 0) .cse0) (and (= 0 (mod ~y$r_buff1_thd2~0_In-1865451141 256)) .cse0) (= 0 (mod ~y$w_buff0_used~0_In-1865451141 256)))) (= |P1Thread1of1ForFork1_#t~ite11_Out-1865451141| ~y$w_buff1~0_In-1865451141) .cse1 (= |P1Thread1of1ForFork1_#t~ite11_Out-1865451141| |P1Thread1of1ForFork1_#t~ite12_Out-1865451141|)) (and (= ~y$w_buff1~0_In-1865451141 |P1Thread1of1ForFork1_#t~ite12_Out-1865451141|) (= |P1Thread1of1ForFork1_#t~ite11_In-1865451141| |P1Thread1of1ForFork1_#t~ite11_Out-1865451141|) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1865451141, ~y$w_buff1~0=~y$w_buff1~0_In-1865451141, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1865451141, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1865451141, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_In-1865451141|, ~weak$$choice2~0=~weak$$choice2~0_In-1865451141, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1865451141} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1865451141, ~y$w_buff1~0=~y$w_buff1~0_In-1865451141, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1865451141, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1865451141, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-1865451141|, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-1865451141|, ~weak$$choice2~0=~weak$$choice2~0_In-1865451141, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1865451141} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11, P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 06:23:15,061 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L758-->L758-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-774100686 256) 0))) (or (and (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-774100686 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In-774100686 256)) (and (= (mod ~y$r_buff1_thd2~0_In-774100686 256) 0) .cse0) (and (= 0 (mod ~y$w_buff1_used~0_In-774100686 256)) .cse0))) (= ~y$w_buff0_used~0_In-774100686 |P1Thread1of1ForFork1_#t~ite14_Out-774100686|) (= |P1Thread1of1ForFork1_#t~ite14_Out-774100686| |P1Thread1of1ForFork1_#t~ite15_Out-774100686|) .cse1) (and (= |P1Thread1of1ForFork1_#t~ite14_In-774100686| |P1Thread1of1ForFork1_#t~ite14_Out-774100686|) (= ~y$w_buff0_used~0_In-774100686 |P1Thread1of1ForFork1_#t~ite15_Out-774100686|) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-774100686, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-774100686, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-774100686, ~weak$$choice2~0=~weak$$choice2~0_In-774100686, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In-774100686|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-774100686} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-774100686, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-774100686, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-774100686, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out-774100686|, ~weak$$choice2~0=~weak$$choice2~0_In-774100686, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-774100686|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-774100686} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 06:23:15,063 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L760-->L761: Formula: (and (= v_~y$r_buff0_thd2~0_52 v_~y$r_buff0_thd2~0_51) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_52, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{P1Thread1of1ForFork1_#t~ite19=|v_P1Thread1of1ForFork1_#t~ite19_9|, P1Thread1of1ForFork1_#t~ite20=|v_P1Thread1of1ForFork1_#t~ite20_10|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_51, P1Thread1of1ForFork1_#t~ite21=|v_P1Thread1of1ForFork1_#t~ite21_8|, ~weak$$choice2~0=v_~weak$$choice2~0_23} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite19, P1Thread1of1ForFork1_#t~ite20, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-27 06:23:15,065 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [642] [642] L763-->L771: Formula: (and (= 0 v_~y$flush_delayed~0_6) (not (= 0 (mod v_~y$flush_delayed~0_7 256))) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= v_~y~0_16 v_~y$mem_tmp~0_5)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~y~0=v_~y~0_16, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_7|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-27 06:23:15,066 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [667] [667] L798-->L798-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-610754373 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-610754373 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite28_Out-610754373| ~y$w_buff0_used~0_In-610754373) (or .cse0 .cse1)) (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite28_Out-610754373| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-610754373, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-610754373} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-610754373, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-610754373, P2Thread1of1ForFork2_#t~ite28=|P2Thread1of1ForFork2_#t~ite28_Out-610754373|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-27 06:23:15,067 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [661] [661] L799-->L799-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In-2077490030 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-2077490030 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-2077490030 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd3~0_In-2077490030 256)))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite29_Out-2077490030|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$w_buff1_used~0_In-2077490030 |P2Thread1of1ForFork2_#t~ite29_Out-2077490030|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2077490030, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2077490030, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2077490030, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2077490030} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2077490030, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2077490030, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2077490030, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out-2077490030|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2077490030} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-27 06:23:15,068 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L800-->L801: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In-620873744 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-620873744 256)))) (or (and (not .cse0) (= 0 ~y$r_buff0_thd3~0_Out-620873744) (not .cse1)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd3~0_In-620873744 ~y$r_buff0_thd3~0_Out-620873744)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-620873744, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-620873744} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-620873744, P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out-620873744|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-620873744} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-27 06:23:15,069 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [670] [670] L801-->L801-2: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In2130514502 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd3~0_In2130514502 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In2130514502 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In2130514502 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork2_#t~ite31_Out2130514502| ~y$r_buff1_thd3~0_In2130514502)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P2Thread1of1ForFork2_#t~ite31_Out2130514502| 0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In2130514502, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2130514502, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In2130514502, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2130514502} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In2130514502, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2130514502, P2Thread1of1ForFork2_#t~ite31=|P2Thread1of1ForFork2_#t~ite31_Out2130514502|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In2130514502, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2130514502} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-27 06:23:15,069 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L801-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#t~ite31_8| v_~y$r_buff1_thd3~0_13) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_13, P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_7|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-27 06:23:15,069 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L824-1-->L830: Formula: (and (= v_~main$tmp_guard0~0_5 1) (= 3 v_~__unbuffered_cnt~0_12)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 06:23:15,070 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L830-2-->L830-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1163625035 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-1163625035 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite35_Out-1163625035| ~y~0_In-1163625035)) (and (= |ULTIMATE.start_main_#t~ite35_Out-1163625035| ~y$w_buff1~0_In-1163625035) (not .cse0) (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1163625035, ~y~0=~y~0_In-1163625035, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1163625035, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1163625035} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1163625035, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-1163625035|, ~y~0=~y~0_In-1163625035, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1163625035, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1163625035} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35] because there is no mapped edge [2019-12-27 06:23:15,070 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [628] [628] L830-4-->L831: Formula: (= v_~y~0_14 |v_ULTIMATE.start_main_#t~ite35_7|) InVars {ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_7|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_6|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_6|, ~y~0=v_~y~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~y~0] because there is no mapped edge [2019-12-27 06:23:15,070 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L831-->L831-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In1308627250 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In1308627250 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite37_Out1308627250| 0)) (and (= ~y$w_buff0_used~0_In1308627250 |ULTIMATE.start_main_#t~ite37_Out1308627250|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1308627250, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1308627250} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1308627250, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1308627250, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out1308627250|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-27 06:23:15,071 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [664] [664] L832-->L832-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In882532247 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd0~0_In882532247 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In882532247 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In882532247 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite38_Out882532247|)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~y$w_buff1_used~0_In882532247 |ULTIMATE.start_main_#t~ite38_Out882532247|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In882532247, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In882532247, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In882532247, ~y$w_buff1_used~0=~y$w_buff1_used~0_In882532247} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In882532247, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In882532247, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out882532247|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In882532247, ~y$w_buff1_used~0=~y$w_buff1_used~0_In882532247} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 06:23:15,072 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [665] [665] L833-->L833-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1201869156 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-1201869156 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite39_Out-1201869156| ~y$r_buff0_thd0~0_In-1201869156)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite39_Out-1201869156| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1201869156, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1201869156} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1201869156, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-1201869156|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1201869156} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 06:23:15,073 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L834-->L834-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In1694579599 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In1694579599 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In1694579599 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In1694579599 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out1694579599| ~y$r_buff1_thd0~0_In1694579599) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite40_Out1694579599| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1694579599, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1694579599, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1694579599, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1694579599} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1694579599|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1694579599, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1694579599, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1694579599, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1694579599} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 06:23:15,073 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L834-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_10 256)) (= v_~main$tmp_guard1~0_10 0) (= v_~__unbuffered_p2_EBX~0_11 0) (= v_~x~0_13 2) (= 0 v_~__unbuffered_p1_EAX~0_10) (= |v_ULTIMATE.start_main_#t~ite40_15| v_~y$r_buff1_thd0~0_18) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= 1 v_~__unbuffered_p2_EAX~0_11)) InVars {~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_11, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_15|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_11, ~x~0=v_~x~0_13} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_11, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_14|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_11, ~x~0=v_~x~0_13, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_18, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite40, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 06:23:15,167 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:23:15 BasicIcfg [2019-12-27 06:23:15,167 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 06:23:15,169 INFO L168 Benchmark]: Toolchain (without parser) took 14906.80 ms. Allocated memory was 136.8 MB in the beginning and 615.5 MB in the end (delta: 478.7 MB). Free memory was 99.7 MB in the beginning and 338.6 MB in the end (delta: -238.9 MB). Peak memory consumption was 239.8 MB. Max. memory is 7.1 GB. [2019-12-27 06:23:15,174 INFO L168 Benchmark]: CDTParser took 0.19 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: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 06:23:15,175 INFO L168 Benchmark]: CACSL2BoogieTranslator took 782.15 ms. Allocated memory was 136.8 MB in the beginning and 200.3 MB in the end (delta: 63.4 MB). Free memory was 99.3 MB in the beginning and 154.1 MB in the end (delta: -54.9 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. [2019-12-27 06:23:15,176 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.58 ms. Allocated memory is still 200.3 MB. Free memory was 154.1 MB in the beginning and 151.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 06:23:15,177 INFO L168 Benchmark]: Boogie Preprocessor took 40.77 ms. Allocated memory is still 200.3 MB. Free memory was 151.4 MB in the beginning and 149.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 06:23:15,177 INFO L168 Benchmark]: RCFGBuilder took 783.15 ms. Allocated memory is still 200.3 MB. Free memory was 149.4 MB in the beginning and 105.7 MB in the end (delta: 43.6 MB). Peak memory consumption was 43.6 MB. Max. memory is 7.1 GB. [2019-12-27 06:23:15,181 INFO L168 Benchmark]: TraceAbstraction took 13225.18 ms. Allocated memory was 200.3 MB in the beginning and 615.5 MB in the end (delta: 415.2 MB). Free memory was 105.7 MB in the beginning and 338.6 MB in the end (delta: -232.9 MB). Peak memory consumption was 182.4 MB. Max. memory is 7.1 GB. [2019-12-27 06:23:15,187 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.19 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: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 782.15 ms. Allocated memory was 136.8 MB in the beginning and 200.3 MB in the end (delta: 63.4 MB). Free memory was 99.3 MB in the beginning and 154.1 MB in the end (delta: -54.9 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 69.58 ms. Allocated memory is still 200.3 MB. Free memory was 154.1 MB in the beginning and 151.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.77 ms. Allocated memory is still 200.3 MB. Free memory was 151.4 MB in the beginning and 149.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 783.15 ms. Allocated memory is still 200.3 MB. Free memory was 149.4 MB in the beginning and 105.7 MB in the end (delta: 43.6 MB). Peak memory consumption was 43.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13225.18 ms. Allocated memory was 200.3 MB in the beginning and 615.5 MB in the end (delta: 415.2 MB). Free memory was 105.7 MB in the beginning and 338.6 MB in the end (delta: -232.9 MB). Peak memory consumption was 182.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.7s, 153 ProgramPointsBefore, 73 ProgramPointsAfterwards, 178 TransitionsBefore, 80 TransitionsAfterwards, 11400 CoEnabledTransitionPairs, 7 FixpointIterations, 34 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 22 ChoiceCompositions, 4847 VarBasedMoverChecksPositive, 127 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 42021 CheckedPairsTotal, 111 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L820] FCALL, FORK 0 pthread_create(&t1010, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L822] FCALL, FORK 0 pthread_create(&t1011, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L824] FCALL, FORK 0 pthread_create(&t1012, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L776] 3 y$w_buff1 = y$w_buff0 [L777] 3 y$w_buff0 = 1 [L778] 3 y$w_buff1_used = y$w_buff0_used [L779] 3 y$w_buff0_used = (_Bool)1 [L748] 2 x = 2 [L751] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L752] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L753] 2 y$flush_delayed = weak$$choice2 [L754] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L755] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L755] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L797] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)=1, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L756] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L757] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L758] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L759] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L759] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L761] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L761] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L762] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L797] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L798] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L799] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L830] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L831] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L832] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L833] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 144 locations, 2 error locations. Result: UNSAFE, OverallTime: 12.9s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 5.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1488 SDtfs, 2285 SDslu, 3286 SDs, 0 SdLazy, 2134 SolverSat, 245 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 124 GetRequests, 31 SyntacticMatches, 6 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13626occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 5180 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 388 NumberOfCodeBlocks, 388 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 332 ConstructedInterpolants, 0 QuantifiedInterpolants, 45750 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...